#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin("apm.in");
ofstream fout("apm.out");

struct muchii
{
    int x,y,c;
}v[400005],rez[200005];
int n,m,tata[200005],h[200005],s,j;
bool criteriu(muchii a,muchii b)
{
    if(a.c>b.c)
        return 0;
    return 1;
}
void citire()
{
    int i;
    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,criteriu);
}
int gasire(int x)
{
    int cx=x,y,aux=x;
    while(tata[x]!=0)
        x=tata[x];
    y=x;
    while(tata[aux]!=0)
    {
        aux=tata[aux];
        tata[cx]=y;
        cx=aux;
    }
    return x;
}
void unire(int x,int y)
{
    if(h[x]>h[y])
        tata[y]=x;
    else
    {
        if(h[y]>h[x])
            tata[x]=y;
        else
        {
            tata[x]=y;
            h[y]++;
        }
    }
}
void rezolvare()
{
    int i,rx,ry;
    for(i=1;i<=m;i++)
    {
        rx=gasire(v[i].x);
        ry=gasire(v[i].y);
        if(rx!=ry)
        {
            unire(rx,ry);
            s=s+v[i].c;
            rez[++j]=v[i];
        }
        if(j==n-1)
            break;
    }
}
void afisare()
{
    int i;
    fout<<s<<'\n'<<n-1<<'\n';
    for(i=1;i<n;i++)
        fout<<rez[i].x<<' '<<rez[i].y<<'\n';
}
int main()
{
    citire();
    rezolvare();
    afisare();
    fout.close();
    return 0;
}