#include <cstdio>
#include <algorithm>
using namespace std;
const int NMAX=200005;
const int MMAX=400005;
struct KRUSK
{
    int x;
    int y;
    int c;
};
KRUSK a[MMAX];
bool cmp(KRUSK a,KRUSK b)
{
    return a.c<b.c;
}
int t[NMAX];
int h[NMAX];
int x1[NMAX];
int y1[NMAX];
int FindSet(int x)
{
    while(t[x]!=x)
        x=t[x];
    return x;
}
void UnionSet(int x,int y)
{
    if(h[x]==h[y])
    {
        t[y]=x;
        h[x]++;
    }
    else
        if(h[x]>h[y])
            t[y]=x;
        else
            t[x]=y;
}
int main()
{
    freopen("apm.in","r",stdin);
    freopen("apm.out","w",stdout);
    int n,m,i,s=0,nr=0,n1,n2,n3;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
    {
        t[i]=i;
        h[i]=1;
    }
    for(i=1;i<=m;i++)
    {
        scanf("%d%d%d",&n1,&n2,&n3);
        a[i].x=n1;
        a[i].y=n2;
        a[i].c=n3;
    }
    sort(a+1,a+m+1,cmp);
    for(i=1;i<=m;i++)
    {
        if(FindSet(a[i].x)!=FindSet(a[i].y))
        {
            nr++;
            s+=a[i].c;
            x1[nr]=a[i].x;
            y1[nr]=a[i].y;
            UnionSet(FindSet(a[i].x),FindSet(a[i].y));
            if(nr==n-1)
                break;
        }
    }
    printf("%d\n%d\n",s,nr);
    for(i=1;i<=nr;i++)
        printf("%d %d\n",x1[i],y1[i]);
    return 0;
}