#include <iostream>
#include <fstream>
#include <cstdlib>
#include <algorithm>
using namespace std;
int dad[200010];
struct prb
{
    int x,y,c;
};
prb v[400010],sol[200010];
bool cmp (prb a, prb b)
{
    if(a.c>b.c)
        return false;
    return true;
}
int Find (int x)
{
    if(dad[x]==x)
        return x;
    dad[x]=Find(dad[x]);
    return dad[x];
}
void Union (int x, int y)
{
    int i,j;
    i=Find(x);
    j=Find(y);
    if(rand()%2==1)
        dad[i]=j;
    else
        dad[j]=i;
}
int main()
{
    ifstream fin ("apm.in");
    ofstream fout ("apm.out");
    int n,m,i,k=0;
    long long suma=0;
    fin>>n>>m;
    for(i=1; i<=m; i++)
        fin>>v[i].x>>v[i].y>>v[i].c;
    sort(v+1,v+m+1,cmp);
    for(i=1;i<=n;i++)
        dad[i]=i;
    for(i=1; i<=m; i++)
    {
        if(Find(v[i].x)!=Find(v[i].y))
        {
            Union(v[i].x,v[i].y);
            sol[++k].x=v[i].x;
            sol[k].y=v[i].y;
            suma+=v[i].c;
        }
    }
    fout<<suma<<"\n"<<n-1<<"\n";
    for(i=1; i<=k; i++)
        fout<<sol[i].x<<" "<<sol[i].y<<"\n";
    return 0;
}