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