#include <bits/stdc++.h>

using namespace std;

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

int n, m, TT[200005], RG[200005], k, Total;
pair < int, int > P[400005];

struct Muchie
{
    int x, y, cost;
}V[400005];

bool Compara(Muchie a, Muchie b)
{
    return a.cost < b.cost;
}

void Citeste()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        fin >> V[i].x >> V[i].y >> V[i].cost;
        TT[i] = i;
        RG[i] = 1;
    }
    sort(V + 1, V + m + 1, Compara);
}

int Gaseste(int nod)
{
    while(TT[nod] != nod)
        nod = TT[nod];
    return nod;
}

void Uneste(int x, int y)
{
    if(RG[x] < RG[y]) TT[x] = y;
    else if(RG[x] > RG[y]) TT[y] = x;
    else
    {
        TT[x] = y;
        RG[y]++;
    }
}

void Rezolva()
{
    for(int i = 1; i <= m; i++)
    {
        int tatal_x, tatal_y;
        tatal_x = Gaseste(V[i].x);
        tatal_y = Gaseste(V[i].y);
        if(tatal_x != tatal_y)
        {
            Uneste(tatal_x, tatal_y);
            P[++k].first = V[i].x;
            P[k].second = V[i].y;
            Total += V[i].cost;
        }
    }
}

void Afiseaza()
{
    fout << Total << "\n" << k << "\n";
    for(int i = 1; i <= k; i++)
        fout << P[i].second << " " << P[i].first << "\n";
}

int main()
{
    Citeste();
    Rezolva();
    Afiseaza();
    return 0;
}