#include <stdio.h>
#include <algorithm>
using namespace std;
FILE *f=fopen("apm.in","r"),*g=fopen("apm.out","w");
int n,m,t[200001],i,nrc,rg[200001],ales[400001],cost;
struct muchie{int y; int c; int x;};
muchie l[400001];
int cmp(muchie a,muchie b)
{
    return (a.c<b.c);
}
int rad(int x)
{
    int r=x;
    while (t[r]!=r) r=t[r];
    int y;
    while (t[x]!=x)
    {
        y=t[x];
        t[x]=r;
        x=y;
    }
    return r;
}
int unite(int x,int y)
{
    nrc--;
    if (rg[rad(x)]>rg[rad(y)])
        t[y]=x;
    else t[x]=y;
    if (rg[rad(x)]==rg[rad(y)]) rg[rad(y)]++;
    return 0;
}
int main(void)
{
    fscanf(f,"%d%d",&n,&m);
    for (i=1;i<=m;i++)
        fscanf(f,"%d%d%d",&l[i].x,&l[i].y,&l[i].c);
    nrc=n;
    for (i=1;i<=n;i++)
        {t[i]=i; rg[i]=1;}
    i=1;
    sort(l+1,l+m+1,cmp);
    while (nrc>1)
    {
        while (rad(l[i].x)==rad(l[i].y))
            i++;
        unite(l[i].x,l[i].y);
        ales[++ales[0]]=i;
        cost+=l[i].c;
    }
    fprintf(g,"%d\n%d\n",cost,ales[0]);
    for (i=1;i<=ales[0];i++)
    {
        fprintf(g,"%d %d\n",l[ales[i]].x,l[ales[i]].y);
    }
    fclose(g);
    return 0;
}