#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#define nmax 200001
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
vector <int> G;
int gr[nmax],x[nmax],y[nmax],ind[nmax],c[nmax];

int grupa(int i)
{
    if(gr[i]==i)
        return i;
    gr[i]=grupa(gr[i]);
    return gr[i];
}

bool s(int i,int j)
{
    return (c[i]<c[j]);
}

int main()
{
    int n,m,k=0,a,b,d;
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        f>>a>>b>>d;
        x[i]=a;
        y[i]=b;
        c[i]=d;
        ind[i]=i;
        gr[i]=i;
    }
    sort(ind+1,ind+m+1,s);
    for(int i=1;i<=m;i++)
    {
        if (gr[x[ind[i]]]!=gr[y[ind[i]]])
        {
            k=k+c[ind[i]];
            gr[grupa(x[ind[i]])]=grupa(y[ind[i]]);
            G.push_back(ind[i]);
        }
    }
    g<<k<<endl<<n-1<<endl;
    for(int i=0;i<G.size();i++)
        g<<x[G[i]]<<" "<<y[G[i]]<<endl;



    return 0;
}