#include<cstdio>
#include<algorithm>
using namespace std;

struct gr{
    int x;
    int y;
    int c;
}a[200005];

int n,m,i,j,x,y,c,t,tata[100005],v1[100005],v2[100005];

int cmp(const gr a1,const gr b)
{
    return a1.c<b.c;
}

void citire()
{
    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);
        a[i].x=x;
        a[i].y=y;
        a[i].c=c;
        tata[i]=i;
    }
}


int main()
{
    citire();
    sort(a+1,a+m+1,cmp);
    j=0;i=0;c=0;

    while (i<=m && j!=n-1){
        i++;
        x=a[i].x,y=a[i].y;
        while(x!=tata[x])x=tata[x];
        while(y!=tata[y])y=tata[y];
        if(tata[x]!=tata[y]){
            j++;
            x=a[i].x,y=a[i].y;
            c=c+a[i].c;
            v1[j]=x;
            v2[j]=y;
            while(x!=tata[x])x=tata[x];

            while(y!=tata[y])
            {
                t=y;
                y=tata[y];
                tata[t]=x;
            }
            tata[y]=x;
        }
    }

    printf("%d\n",c);
    printf("%d\n",n-1);
    for(i=1;i<=n-1;i++)printf("%d %d\n",v1[i],v2[i]);
    return 0;
}