#include <fstream>
#include <algorithm>


using namespace std;

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

const int MMax=400008;

pair <int, int> P[MMax];
int k;

int n,m,total, TT[MMax], RG[MMax];

struct muchie{
    int x,y,cost;
}v[MMax];

bool compar(muchie a, muchie b)
{
    return a.cost<b.cost;
}

void read(){
    fin>>n>>m;
    int i;
    for(i=1;i<=m;i++)
        fin>>v[i].x>>v[i].y>>v[i].cost;

    sort(v+1, v+m+1, compar);

    //for(int i=1;i<=m;i++)
      //  fout<<v[i].x<<" "<<v[i].y<<" "<<v[i].cost<<'\n';
}

int gasesctatal(int Nod) {
    while(TT[Nod]!=Nod)
        Nod=TT[Nod];
    return Nod;
}

void unire(int x, int y) {
    if(RG[x]< RG[y])
        TT[x]=y;
    if(RG[x] > RG[y])
        TT[y]=x;
    if(RG[x] == RG[y])
    {
        TT[x]=y;
        RG[y]++;
    }
}

void rezolva() {
    for(int i=1;i<=m;i++)
    {
        //int tatal_x=gasesctatal(v[i].x);
        //int tatal_y=gasesctatal(v[i].y);
        if(gasesctatal(v[i].x) != gasesctatal(v[i].y))
        {
            unire(gasesctatal(v[i].x), gasesctatal(v[i].y));
            P[++k].first=v[i].x;
            P[k].second=v[i].y;
            total+=v[i].cost;
        }
    }
}

void afisare()
{
    fout<<total<<'\n';
    fout<<n-1<<'\n';

    for(int i=1;i<=k;i++) {
        fout<<P[i].first<<" "<<P[i].second;
        fout<<'\n';
    }
}

int main()
{
    read();
    for(int i=1;i<=m;i++)
    {
        TT[i]=i;
        RG[i]==1;
    }
    rezolva();
    afisare();
    return 0;
}