#include <cstdio>
#include <algorithm>
using namespace std;
int i,x,y,n,m,c,k,j,cost,t[400007],aux,x1,y1,nr,h[400007],s,poz[400007];

struct nod
{
    int x, y, c;
} a[400007];

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+1+m, cmp);
    /*for (i=1; i<=m; i++)
    {
        printf("%d %d %d\n",a[i].x, a[i].y, a[i].c);
    }*/
    for(i=1;i<=n;i++)
    {
        h[i]=1;
        t[i]=i;
    }
    for(i=1;i<=m;i++)
    {
        x1=tata(a[i].x);
        y1=tata(a[i].y);
        if(x1!=y1)
        {
            if(h[x1]<h[y1]) t[x1]=y1;
            else t[y1]=x1;
            if(h[x1]==h[y1]) h[y1]++;
            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;
}