#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

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

struct Obj
{

    Obj( int _x, int _y, int _c ) : x{_x}, y{_y}, c{_c}
    {}

    bool operator < (const Obj& d ) const
    {
        return c < d.c || (c == d.c && x < d.x) || (c == d.c && x == d.x && y < d.y );

    }
    int x, y, c;
};

int n, m, cost;
vector<Obj> G;
vector<pair<int, int>> sol;
vector<int> g, mf;

void Read();
int Grupa(int i);


int main()
{
    Read();
    sort(G.begin(), G.end());
    for ( auto a : G )
    {
        if ( Grupa(a.x) != Grupa(a.y) )
        {
            cost += a.c;
            g[Grupa(a.y)] = Grupa(a.x);
            sol.push_back({a.x, a.y});
        }
    }
    fout << cost << '\n' << n - 1 << '\n';
    for ( auto a : sol )
        fout << a.first << ' ' << a.second << '\n';
    return 0;
}

void Read()
{
    fin >> n >> m;

    g = vector<int>(n + 1);

    int x, y, c;
    for (int i = 1; i <= m; ++i)
    {
        fin >> x >> y >> c;
        G.push_back(Obj(x, y, c));

    }
    for (int i = 1; i <= n; ++i)
    {
        g[i] = i;
    }

}
int Grupa(int i)
{
    if (g[i] == i) return i;
    g[i] = Grupa(g[i]);
    return g[i];
}