#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
struct muchie
{
    int x,y,c;
};
muchie v[400001];
int l[200001],u[400001]={0};
int cauta(int nod)
{
    if(l[nod]==nod) return nod;
    return l[nod]=cauta(l[nod]);
}
bool sortare(muchie p, muchie q)
{
    if(p.c<q.c) return true;
    return false;
}
int main()
{
    int c=0,i,m,n,nr=0,r1,r2;
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>v[i].x>>v[i].y>>v[i].c;
    }
    sort(v+1,v+m+1,sortare);
    for(i=1;i<=n;i++) l[i]=i;
    for(i=1;i<=m;i++)
    {
        r1=cauta(v[i].x);
        r2=cauta(v[i].y);
        if(r1!=r2)
        {l[r1]=r2;
        c=c+v[i].c;
        u[i]=1;
        nr++;
        }

    }
    g<<c<<endl<<nr<<endl;
    for(i=1;i<=m;i++)
    {
        if(u[i]==1)
        {
            g<<v[i].x<<" "<<v[i].y<<endl;
        }
    }
    return 0;
}