#include<bits/stdc++.h>
#define N 200100
using namespace std;
ifstream in("apm.in");
ofstream out("apm.out");
struct edge{int x,y,c;}v[N];
int n, m, ans, GR[N], t, sol[N];
int cmp(edge a,edge b)
{
    return a.c<b.c;
}
int gr(int i)
{
    if(GR[i]==i) return i;
    GR[i]=gr(GR[i]);
    return GR[i];
}
void unite(int i,int j)
{
    GR[gr(i)]=gr(j);
}

int main()
{
    in>>n>>m;
    for(int i=0;i<m;++i)
        in>>v[i].x>>v[i].y>>v[i].c;
    sort(v, v+m, cmp);
    for(int i=1;i<=n;++i)
        GR[i]=i;
    for(int i=0;i<m;++i)
    {
        if(gr(v[i].x)!=gr(v[i].y))
        {
            ans+=v[i].c;
            unite(v[i].x,v[i].y);
            sol[++t]=i;
        }
    }
    out<<ans<<'\n'<<n-1<<'\n';
    for(int i=1;i<n;++i)
        out<<v[sol[i]].x<<' '<<v[sol[i]].y<<'\n';
    return 0;
}