#include<cstdio>
#include<algorithm>
#define NMax 200005
#define MMax 400005
using namespace std;

int n,m,sol[NMax],p[NMax],rang[NMax];

struct tip
{
    int x,y,cost;
};
tip a[MMax];

int cmp (tip xx, tip yy)
{
    return xx.cost < yy.cost;
}

int find (int x)
{
    if (x!=p[x])
        p[x]=find(p[x]);
    return p[x];
}

void unite (int x, int y)
{
    if (rang[x]>rang[y])
        p[y]=x;
    else p[x]=y;
    if (rang[x]==rang[y])
        rang[y]++;
}

int main ()
{
    int i,sum=0;
    freopen("apm.in","r",stdin);
    freopen("apm.out","w",stdout);
    scanf("%d%d",&n,&m);
    for (i=1; i<=n; i++)
    {
        p[i]=i;
        rang[i]=0;
    }
    for (i=1; i<=m; i++)
        scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].cost);
    sort(a+1,a+m+1,cmp);
    for (i=1; i<=m,sol[0]<n-1; i++)
        if (find(a[i].x)!=find(a[i].y))
        {
            sol[++sol[0]]=i;
            sum+=a[i].cost;
            unite(find(a[i].x),find(a[i].y));
        }
    printf("%d\n%d\n",sum,n-1);
    for (i=1; i<n; i++)
        printf("%d %d\n",a[sol[i]].x,a[sol[i]].y);
    return 0;
}