#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

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

struct drum
{
    int nod1, nod2, cost, ap;
};

drum v[400001];

int tati[200001];

int i, n, m, costmin, nrsol, j;

bool cmp(drum a, drum b)
{
    if(a.cost>b.cost)
        return false;
    return true;
}

int tata(int nod)
{
    if(tati[nod]==nod)
        return nod;
    else
        return tati[nod]=tata(tati[nod]);
}

void join(int nod, int node)
{
    int rx, ry;
    rx=tata(nod);
    ry=tata(node);
    tati[rx]=ry;
}

int main()
{
    fin>>n>>m;
    for(i=1; i<=n; i++)
    {
        tati[i]=i;
        v[i].ap=0;
    }
    for(i=1; i<=m; i++)
        fin>>v[i].nod1>>v[i].nod2>>v[i].cost;
    sort(v+1, v+m+1, cmp);
    i=1;
    nrsol=1;
    while(nrsol<n && i<=m)
    {
        if(tati[tata(v[i].nod1)]!=tati[tata(v[i].nod2)])
        {
            v[i].ap=1;
            join(v[i].nod1, v[i].nod2);
            costmin=costmin+v[i].cost;
            nrsol++;
        }
        i++;
    }
    nrsol--;
    j=1;
    fout<<costmin<<endl<<nrsol<<endl;
    for(i=1; i<=m && j<n; i++)
    {
        fout<<v[i].nod2<<" "<<v[i].nod1<<endl;
        j++;
    }
    return 0;
}