#include <cstdio>
#include <algorithm>
using namespace std;
const int N=200000,M=400000;
FILE *in=fopen ("apm.in","r");
FILE *out=fopen ("apm.out","w");
int n,t[M],corect[M];
struct muchie {
 int x1,x2,lung;
}v[M];
int radacina (int x)
{
    if (t[x]==0) return x;
    t[x]=radacina (t[x]);
    return t[x];
}
bool cmp (muchie a,muchie b)
{
    return a.lung<b.lung;
}
void unire (int x,int y)
{
    int rx=radacina(x),ry=radacina(y);
    t[rx]=ry;
}
bool gasire (int x,int y)
{
    return radacina(x)==radacina(y);
}
void citire ()
{
    int s=0,a;
    fscanf (in,"%d%d",&n,&a);
    for (int i=1;i<=a;i++)
    {
        int p,x,c;
        fscanf (in,"%d%d%d",&p,&x,&c);
        v[i].x1=p;
        v[i].x2=x;
        v[i].lung=c;
    }
    sort (v+1,v+1+a,cmp);
    int k=0;
    for (int i=1;i<=a;i++)
    {
        if (!gasire (v[i].x1,v[i].x2))
        {
            s+=v[i].lung;
            unire (v[i].x1,v[i].x2);
            corect[++k]=i;
        }
    }
    fprintf (out,"%d\n%d\n",s,k);
    for (int i=1;i<=k;i++)
    {
        fprintf (out,"%d %d\n",v[corect[i]].x1,v[corect[i]].x2);
    }
}
int main()
{
    citire();
    return 0;
}