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

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

vector<tuple<int, int, int>> lista_muchii;
vector<pair<int, int>> tata;
vector<int> culoare;

int N, M;

void reuneste(int u, int v)
{
    int cul1, cul2;
    cul1 = culoare[u];
    cul2 = culoare[v];
    for(int i=1; i<=N; i++)
    {
        if(culoare[i] == cul2)
            culoare[i] = cul1;
    }
}

int main()
{
    fin>>N>>M;
    culoare.assign(N+1, 0);
    for(int i=1; i<=M; i++)
    {
        int X, Y, C;
        fin>>X>>Y>>C;
        lista_muchii.push_back({C,X,Y});
    }

    sort(lista_muchii.begin(), lista_muchii.end());

    for(int i=1; i<=N; i++)
    {
        culoare[i] = i;
    }

    int k = 0, s = 0;

    for(int i=0; i<M; i++)
    {
        int cost, v1, v2;
        cost = get<0>(lista_muchii[i]);
        v1 = get<1>(lista_muchii[i]);
        v2 = get<2>(lista_muchii[i]);

        if(culoare[v1] != culoare[v2])
        {
            s += cost;
            tata.push_back({v1, v2});
            reuneste(v1, v2);
            k++;
            if(k == N-1)
                break;
        }
    }


    fout<<s<<endl<<k<<endl;
    for(int i=0; i<k; i++)
    {
        int v1, v2;
        v1 = tata[i].first;
        v2 = tata[i].second;
        fout<<v1<<' '<<v2<<endl;
    }


    return 0;
}