#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;

FILE *fin=fopen("apm.in", "r"), *fout=fopen("apm.out", "w");

#define MAX 200100

typedef long long int lli;

int fr[MAX],cost,i, n, v, m, j, g, b[MAX], c[MAX];

struct sebi{
    int x,y,c;
};

sebi a[2*MAX];

inline bool cmp(sebi d, sebi f)
{
    return d.c<f.c;
}

int main()
{

    fscanf(fin, "%d %d\n", &n, &m);
    for(i=1;i<=m;i++)
    {
        fscanf(fin, "%d %d %d\n", &a[i].x, &a[i].y, &a[i].c);
    }
    for(i=1;i<=n;i++)
        fr[i]=i;
    sort(a+1,a+m+1,cmp);
    g=0;
    cost=0;
    for(i=1;g<n-1;i++)
    {
        if(fr[a[i].x]!=fr[a[i].y])
        {
            cost+=a[i].c;
            b[g]=a[i].x;
            c[g]=a[i].y;
            g++;

            v=fr[a[i].x];
            m=fr[a[i].y];
            for(j=1;j<=n;j++)
            {
                if(fr[j]==v)
                    fr[j]=m;
            }
        }
    }
    fprintf(fout, "%d\n%d\n", cost, n-1);

    for(i=0;i<n-1;i++)
        fprintf(fout, "%d %d\n", b[i], c[i]);

    return 0;
}