#include<cstdio>
#include<algorithm>
using namespace std;
int i,n,m,x,k,t,s,y,j,c,d[200004],b[200004];
struct nod
{
    int x,y,c;
};
nod a[400003];
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);
        a[i].x=x;
        a[i].y=y;
        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&&k<n-1;i++)
    {
        x=a[i].x;
        y=a[i].y;
        c=a[i].c;
        if(b[x]!=b[y])
        {
            t=b[y];
            for(j=1;j<=n;j++)
                if(b[j]==t)b[j]=b[x];
            s=s+c;
            k++;
            d[k]=i;
        }
    }
    printf("%d\n%d\n",s,k);
    for(i=1;i<=k;i++)
        printf("%d %d\n",a[d[i]].x,a[d[i]].y);
    return 0;
}