#include<fstream>
#include<algorithm>
#define NM 200100
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
struct el{int x,y,c;}v[NM];
int i,n,m,t[NM],k,sol[NM],S,r1,r2;
int cmp(el a,el b)
{
    return a.c<b.c;
}
int rad(int x)
{
    while (x!=t[x])
        x=t[x];
    return x;
}

int main ()
{
    f>>n>>m;
    for(i=1;i<=m;++i)
    {
        f>>v[i].x>>v[i].y>>v[i].c;
    }
    sort(v+1,v+m+1,cmp);
    for(i=1;i<=n;++i) t[i]=i;
    for(i=1;i<=m;++i)
    {
        r1=rad(v[i].x);
        r2=rad(v[i].y);
        if(r1!=r2)
        {
            S+=v[i].c;
            t[r1]=r2;
            sol[++k]=i;
        }
    }
    g<<S<<"\n"<<n-1<<"\n";
    for(i=1;i<n;++i)
        g<<v[sol[i]].x<<" "<<v[sol[i]].y<<"\n";
    return 0;
}