#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("apm.in");
ofstream fout ("apm.out");
int n,m,tt[400010],nrm,xx,yy;
long long cost;
struct muchie{int x,y,c;}v[400010];
bool k[400010];
bool comp(muchie a,muchie b)
{
    if(a.c<b.c)
        return 1;
    return 0;
}
int tata(int nod)
{
    while(tt[nod]!=nod)
    {
        nod=tt[nod];
    }
    return nod;
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>v[i].x>>v[i].y>>v[i].c;
        tt[i]=i;
    }
    sort(v+1,v+m+1,comp);
    for(int i=1;i<=n;i++)
    {
        tt[i]=i;
    }

    for(int i=1;i<=m;i++)
    {
        ///fout<<v[i].x<<" "<<v[i].y<<":      ";
        xx=tata(v[i].x);
        yy=tata(v[i].y);
        if(xx!=yy)
        {
            cost+=v[i].c;
            tt[xx]=tt[yy];
            k[i]=1;
        }
        /*
        for(int i=1;i<=n;i++)
        {
            fout<<tt[i]<<" ";
        }
        fout<<"   "<<nrm<<'\n';
        */
    }
    ///fout<<'\n';
    fout<<cost<<'\n'<<n-1<<'\n';
    for(int i=1;i<=m;i++)
    {
        if(k[i])
        {
            fout<<v[i].x<<" "<<v[i].y<<'\n';
        }
    }
    return 0;
}