#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
int n, m, x, y, d, k=1, s, l[200001];
int ms[400001];
struct muchii
{
    int x, y, d;
}v[400001];
int comp(muchii a, muchii b)
{
    return a.d<b.d;
}
int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        fin>>v[i].x>>v[i].y>>v[i].d;
        l[i]=i;
    }
    sort(v+1, v+m+1, comp);
    for(int i=1;i<=m;i++)
    {
        if(l[v[i].x]!=l[v[i].y])
        {
            s+=v[i].d;
            ms[k]=i;
            k++;
            int a=l[v[i].y], b=l[v[i].x];
            for(int j=1;j<=n;j++)
            {
                if(l[j]==a)
                {
                    l[j]=b;
                }
            }
        }
    }
    fout<<s<<'\n';
    k--;
    fout<<k<<'\n';
    for(int i=1;i<=k;i++)
    {
        fout<<v[ms[i]].x<<' '<<v[ms[i]].y<<'\n';
    }
    fin.close();
    fout.close();
    return 0;
}