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

ifstream fin("apm.in");
ofstream fout("apm.out");

#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 gr(int s)
{
    if(fr[s]==s)
        return s;
    return gr(fr[s]);
}

int main()
{
    fin>>n;
    fin>>m;
    for(i=1;i<=m;i++)
    {
        fin>>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(gr(a[i].x)!=gr(a[i].y))
        {
            cost+=a[i].c;
            b[g]=a[i].x;
            c[g]=a[i].y;
            g++;
            fr[gr(a[i].x)]=gr(a[i].y);
        }
    }
    fout<<cost<<"\n"<<n-1<<"\n";
    for(i=0;i<n-1;i++)
        fout<<c[i]<<" "<<b[i]<<"\n";

    return 0;
}