#include<fstream>
#include<algorithm>
using namespace std;
ifstream cin("apm.in");
ofstream cout("apm.out");
int n,m,r[200001],s,k;
struct muchie
{
    int x,y,c;
}v[200001],rez[200001];
bool cmp(muchie a, muchie b)
{
    return a.c<b.c;
}
int cauta(int x)
{
    if(x!=r[x])
        r[x]=cauta(r[x]);
    return r[x];
}
void unire(int x,int y)
{
    int rx=cauta(x);
    int ry=cauta(y);
    if(rx!=ry)
        r[rx]=ry;
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        r[i]=i;
    for(int i=1;i<=m;i++)
        cin>>v[i].x>>v[i].y>>v[i].c;
    sort(v+1,v+m+1,cmp);
    for(int i=1;i<=m;i++)
    {
        if(cauta(v[i].x)!=cauta(v[i].y))
       {
            unire(v[i].x,v[i].y),s=s+v[i].c;
            rez[++k].x=v[i].x,rez[k].y=v[i].y;
       }
    }
    cout<<s<<'\n';
    cout<<k<<'\n';
    for(int i=1;i<=k;i++)
        cout<<rez[i].x<<' '<<rez[i].y<<'\n';
    return 0;
}