#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
int n, m, i, j, s, t[200010], k, a[200010], rx, ry;

struct apm{
    int x, y, c;
} v[400010];

bool cmp(apm x, apm y){
    return x.c<y.c;
}

int rad(int x){
    while(t[x]>0)
        x=t[x];
    return x;
}

int main(){
    f>>n>>m;
    for(i=1; i<=n; i++)
        t[i]=-1;
    for(i=1; i<=m; i++)
        f>>v[i].x>>v[i].y>>v[i].c;
    f.close();
    sort(v+1, v+m+1, cmp);
    s=0;
    for(i=1; i<=m; i++)
    {
        rx=rad(v[i].x);
        ry=rad(v[i].y);
        if(rx!=ry)
        {
            s+=v[i].c;
            a[++k]=i;
            if(t[rx]<t[ry])
            {
                t[rx]+=t[ry];
                t[ry]=rx;
            }
            else
            {
                t[ry]+=t[rx];
                t[rx]=ry;
            }
        }
    }
    g<<s<<"\n"<<k<<"\n";
    for(i=1; i<n; i++)
    {
        k=a[i];
        g<<v[k].x<<' '<<v[k].y<<"\n";
    }
    g.close();
    return 0;
}