#include <bits/stdc++.h>
using namespace std;
int n,m,i,radx,rady,s,nr,t[200005];
struct andreea
{
    int x,y,cost,ok;
}a[400005];
bool cmp(andreea a, andreea b)
{
    if(a.cost>=b.cost)return 0;
    return 1;
}
int tata(int x)
{
    if(t[x]==x)return x;
    return tata(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",&a[i].x,&a[i].y,&a[i].cost);
    }
    for(i=1;i<=n;i++)
        t[i]=i;
    sort(a+1,a+m+1,cmp);
    for(i=1;i<=m;i++)
    {
        radx=tata(a[i].x);
        rady=tata(a[i].y);
        if(radx!=rady)
        {
            s=s+a[i].cost;
            t[rady]=radx;
            a[i].ok=1;
        }
    }
    for(i=1;i<=m;i++)
        if(a[i].ok==1)nr++;
    printf("%d\n%d\n",s,nr);
    for(i=1;i<=m;i++)
        if(a[i].ok==1)printf("%d %d\n",a[i].x,a[i].y);
    return 0;
}