#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
int n,m,x,y,s,k,t[200004];
struct str
{
    int x,y,c;
}a[400003],ras[200003];
bool cmp(str x, str y)
{
    if(x.c==y.c&&x.x==y.x)return x.y<y.y;
    if(x.c==y.c)return x.x<y.x;
    return x.c<y.c;
}
int tata(int x)
{
    if(t[x]==x)return x;
    return t[x]=tata(t[x]);
}
int main()
{
    freopen("apm.in","r",stdin);
    freopen("apm.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(int i=1;i<=m;i++)
        scanf("%d %d %d",&a[i].x,&a[i].y,&a[i].c);
    sort(a+1,a+m+1,cmp);
    for(int i=1;i<=n;i++)
        t[i]=i;
    for(int i=1;i<=m&&k<n-1;i++)
    {
        x=tata(a[i].x);
        y=tata(a[i].y);
        if(x!=y)
        {
            t[x]=y;
            s+=a[i].c;
            ras[++k].x=a[i].x;
            ras[k].y=a[i].y;
        }
    }
    printf("%d\n%d\n",s,k);
    for(int i=1;i<=k;i++)
        printf("%d %d\n",ras[i].x,ras[i].y);
    return 0;
}