#include<cstdio>
#include<algorithm>
#define nx 400007
using namespace std;

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

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

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 re(int x)
{
    while(x!=tata[x])x=tata[x];
    return x;
}


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;
        x=re(x);
        y=re(y);
        if(x!=y)
        {
            j++;
            c+=a[i].c;
            v1[j]=a[i].x;
            v2[j]=a[i].y;
            if(y>x)tata[x]=y;
            else 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;
}