#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

const int MAXN = 1000;

int N, M, a[MAXN][MAXN], cost[MAXN][MAXN], treeCost;
bool used[MAXN];

void input()
{
    int c, d, p;
    scanf("%d%d", &N, &M);

    for(int i=0; i<M; i++)
    {
        scanf("%d%d%d", &c, &d, &p);
        a[c-1][d-1] = a[d-1][c-1] = 1;
        cost[c-1][d-1] = cost[d-1][c-1] = p;
    }
}

void dfs( int i )
{
    used[i]=1;

    for(int j=0; j < N; j++)
        if(a[i][j] == 1 && !used[j])
        {
            a[i][j] = a[j][i] = 2;
            dfs(j);
        }
}

void print()
{
    for(int i = 0; i<N; i++)
    {
        for(int j = 0; j<N; j++)
            printf("%d ", a[i][j]);
        printf("\n");
    }
}

void dfs_spanTree( int i )
{
    used[i]=1;
    cout << "i: " << i << endl;
    for(int j=0; j < N; j++)
        if(a[i][j] == 2 && !used[j])
        {
            treeCost += cost[i][j];
            dfs_spanTree(j);
        }
}

int main()
{
    input();
    dfs(0);

    print();

    memset(used, 0, sizeof(used));
    dfs_spanTree(0);

    printf("treeCost is: %d\n", treeCost);

    return 0;
}
/**

6 10
1 2 1
3 6 1
3 1 2
3 2 4
1 6 3
5 3 2
3 4 1
4 5 1
4 2 10
2 5 1

Sorted:
1 2 1
3 6 1
3 1 1
3 4 1
4 5 1
2 5 1
5 3 2
1 6 3
3 2 4
4 2 10

**/