// KRUSKA
#include<cstdio>
#include<algorithm>
using namespace std;
int n,m,i,x,y,c,z,x1,y1,t,j,b[200004],mch[200004];
long long s;
struct nod
{
    int x,y;
    short c;
}a[400003];
int tata(int x)
{
    if(x==b[x])return x;
    else return tata(b[x]);
}
bool cmp(nod a, nod b)
{
    if(a.c>b.c)return 0;
    return 1;
}
int main()
{
    freopen("apm.in","r",stdin);
    freopen("apm.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(i=1;i<=m;i++)
    {
        scanf("%d %d %d",&x,&y,&c);
        if(x<y){a[i].x=x;a[i].y=y;}
        else {a[i].x=y;a[i].y=x;}
        a[i].c=c;
    }
    for(i=1;i<=n;i++)
        b[i]=i;
    sort(a+1,a+m+1,cmp);
    for(i=1;i<=m;i++)
    {
        x=a[i].x;
        y=a[i].y;
        c=a[i].c;
        x1=tata(x);
        y1=tata(y);
        if(x1!=y1)
        {
            if(y1>x1)b[y]=x;
            else b[x]=y;
            s=s+c;
            z++;
            mch[z]=i;
            if(z==n-1)break;
        }
    }
    printf("%d\n",s);
    printf("%d\n",z);
    for(i=1;i<=z;i++)
        printf("%d %d\n",a[mch[i]].x,a[mch[i]].y);
    return 0;
}