#include<algorithm>
#include<cstdio>
using namespace std;
int x1,y1,aux,j,k,s,x,y,c,i,n,m,h[400009],b[400009],aa[400009],bb[400009];
struct nod
{
    int x,y,c;
};
nod a[400009];
bool cmp(nod a,nod b)
{
    if(a.c>b.c) return 0;
    return 1;
}
int tata(int x)
{
    if(b[x]!=x) b[x]=tata(b[x]);
    return b[x];
}
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);
        a[i].x=x;
        a[i].y=y;
        a[i].c=c;
    }
    sort(a+1,a+m+1,cmp);
    for(i=1;i<=n;i++)
    {
        h[i]=1;
        b[i]=i;
    }
    for(i=1;i<=m;i++)
    {
        x1=tata(a[i].x);
        y1=tata(a[i].y);
        if(x1!=y1)
        {
            if(h[x1]<h[y1]) b[x1]=y1;
            else b[y1]=x1;
            if(h[x1]==h[y1]) h[y1]++;
            k++;
            aa[k]=i;
            s=s+a[i].c;
            if(k==n-1) break;
        }
    }
    printf("%d\n",s);
    printf("%d\n",k);
    for(i=1;i<=k;i++)
        printf("%d %d\n",a[aa[i]].x,a[aa[i]].y);
    return 0;
}