#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<int> tata;
vector<pair<int, int>> arbore;
vector<int> h;

int N, M;

void Initializare(int u)
{
    tata[u] = 0;
    h[u] = 0;
}

int reprezentant(int u)
{
    while(tata[u] != 0)
    {
        u = tata[u];
    }
    return u;
}

void reuneste(int u, int v)
{
    int ru = reprezentant(u);
    int rv = reprezentant(v);

    if(h[ru] > h[rv])
    {
        tata[rv] = ru;
    }
    else
    {
        tata[ru] = rv;
        if(h[ru] == h[rv])
            h[rv]++;
    }
}

int main()
{
    fin>>N>>M;
    tata.assign(N+1, 0);
    h.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++)
        Initializare(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(reprezentant(v1) != reprezentant(v2))
        {
            s += cost;
            arbore.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 = arbore[i].first;
        v2 = arbore[i].second;
        fout<<v1<<' '<<v2<<endl;
    }


    return 0;
}