#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#define noduri 200001

using namespace std;

ifstream f("apm.in");
ofstream g("apm.out");

int n,m,rad[noduri];
vector < pair<int,int> > q;

struct eu
{
    int lin,col,cost;
} v[noduri*2];

void citire()
{
    int i;
    f >> n >> m;
    for(i=1; i<=m; i++)
    {
        f >> v[i].lin >> v[i].col >> v[i].cost;
        rad[i] = i;
    }
}

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

int grupa(int x)
{
    if(rad[x] == x)
        return x;
    rad[x] = grupa(rad[x]);
    return grupa(rad[x]);
}

void cauta(int x,int y)
{
    rad[grupa(x)] = grupa(y);
}

int main()
{
    int i,k=0,costul=0;
    citire();
    sort(v+1,v+m+1, cmp);
    for(i=1; i<=m; i++)
    {
        if(grupa(v[i].lin) != grupa(v[i].col))
        {
            k++;
            costul += v[i].cost;
            q.push_back(make_pair(v[i].lin,v[i].col));
            cauta(v[i].lin, v[i].col);
        }
    }
    g << costul << '\n' << k << '\n';
    for(i=0; i<k; i++)
        g << q[i].first << " " << q[i].second << '\n';
    return 0;
}