#include    <fstream>
#include    <algorithm>
#include <iostream>
using namespace std;

ifstream fin("apm.in");
ofstream fout("apm.out");


struct graf {

    int x, y, c;
}g[100];

int t[100];
graf rez[100];
int n, m;

bool compara(graf a, graf b)
{
    if (a.c < b.c) return 1;
    return 0;
}

void citire()
{
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int a, b, d;
        fin >> a >> b >> d;
        g[i].x = a;
        g[i].y = b;
        g[i].c = d;
    }
}

void rezolvare()
{
    int cnt = 0;
    int cost = 0;
    sort(g + 1, g + 1 + m, compara);
    for (int i = 1; i <= n; i++) t[i] = i;
    //cout << g[1].x << ' ' << g[1].y << ' ';
    for (int i = 1; i <= m ; i++)
    {
        int a = t[g[i].x];
        int b = t[g[i].y];
       // cout << a << ' ' << b << '\n';
        if (a != b)
        {
            cost += g[i].c;
            rez[++cnt] = g[i];
            for (int j = 1; j <= n; j++)
            {
                if (t[j] == t[g[i].y]) {
                    t[j] = t[g[i].x];
                }
            }
        }
    }
    fout << cost << '\n';
    //fout << n - 1 << '\n';
    for (int i = 1; i < n; i++)
        fout << rez[i].y << ' ' << rez[i].x << '\n';

}

int main()
{
    citire();
    rezolvare();
}