#include <iostream>
#include <queue>
#include <algorithm>
#include <cstdio>
#include <vector>
#define mmax 400001
#define nmax 200001
using namespace std;
FILE *f=fopen("apm.in","r"),*g=fopen("apm.out","w");
struct muc{
    int c,x,y;
}v[mmax],r[nmax];
int d[nmax],t[nmax],rg[nmax],k;
struct cmp{
    int operator()(int x, int y)
    {
        return v[x].c>v[y].c;
    }
};
priority_queue <int, vector <int>, cmp> h;
int finds(int x)
{
    int r,i;
    for(r=x;t[r]!=r;r=t[r]);
    while(x!=t[x])
    {
        i=t[x];
        t[x]=r;
        x=i;
    }
    return r;
}
void unire(int x, int y)
{
    if(rg[x]<rg[y])
        t[x]=y;
    else
        t[y]=x;
    if(rg[x]==rg[y])
        rg[x]++;
}
int main()
{
    int i,j,n,m,x,y,s=0; muc aux;
    fscanf(f,"%d %d",&n,&m);
    for(i=1;i<=m;i++)
    {
        fscanf(f,"%d %d %d",&v[i].x,&v[i].y,&v[i].c);
        h.push(i);
    }
    for(i=1;i<=n;i++)
    {
        t[i]=i;
        rg[i]=1;
    }
    while(k<n-1)
    {
        x=h.top();
        h.pop();
        i=finds(v[x].x);
        j=finds(v[x].y);
        if(i!=j)
        {
            unire(i,j);
            s+=v[x].c;
            ++k;
            r[k]=v[x];
        }
    }
    fprintf(g,"%d\n%d\n",s,k);
    for(i=1;i<=k;i++)
        fprintf(g,"%d %d\n",r[i].x,r[i].y);
    fclose(f);
    fclose(g);
    return 0;
}