#include<fstream>
#include<algorithm>
#define NMax 200001
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
struct muchie
{
    int x,y,c;
}v[NMax];
int n,m;
int i;
int dad[NMax],sol[NMax],da[NMax];
int t,S;
int cmp(muchie a,muchie b)
{
    return a.c<b.c;
}
int Father(int x)
{
    while(dad[x]!=x)
    x=dad[x];
    return x;
}
void Unite(int x,int y)
{
    if(da[x]<da[y])
    dad[x]=y;
    if(da[x]>da[y])
    dad[y]=x;
    if(da[x]==da[y])
    {
        dad[x]=y;
        da[y]++;
    }
}
int main()
{
    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,cmp);
    for(i=1;i<=n;i++)
    dad[i]=i;
     for(i=1;i<=m;i++)
    {
        if(Father(v[i].x)!=Father(v[i].y))
        {
            S+=v[i].c;
            Unite(Father(v[i].x),Father(v[i].y));
            sol[++t]=i;
        }
    }
    g<<S<<"\n"<<n-1<<"\n";
    for(i=1;i<n;i++)
     g<<v[sol[i]].y<<" "<<v[sol[i]].x<<"\n";
     return 0;
}