#include <fstream>
#include<algorithm>
using namespace std;
ifstream in("apm.in");
ofstream out("apm.out");

struct ura
{
    int nod1,nod2,cost;
}v[400001];
int viz[400001], tata[200001];
int n, m, nrm, s;
bool mycmp(ura a, ura b)
{
    return (a.cost<b.cost);
}
int tatasuprem (int nod)
{
    if(tata[nod]==nod)
        return nod;
    else
        return tata[nod]=tatasuprem(tata[nod]);
}
void unire(int nod1, int nod2)
{
    int tata1=tatasuprem(nod1);
    int tata2=tatasuprem(nod2);
    tata[tata2]=tata1;
}
int main()
{
    int i;
    in>>n>>m;
    for(i=1; i<=m; i++)
        in>>v[i].nod1>>v[i].nod2>>v[i].cost;
    sort (v+1, v+m+1, mycmp);
    for(i=1; i<=n; i++)
       tata[i]=i;
    nrm=0;
    s=0;
    for(i=1; i<=m && nrm<n-1; i++)
        if(tatasuprem(v[i].nod1)!=tatasuprem(v[i].nod2))
        {
            unire(v[i].nod1, v[i].nod2);
            s+=v[i].cost;
            nrm++;
            viz[i]=1;
        }
    out<<s<<'\n'<<n-1<<'\n';
    for(i=1; i<=m; i++)
        if(viz[i]==1)
            out<<v[i].nod1<<" "<<v[i].nod2<<'\n';
    return 0;
}