#include <fstream>
#include <algorithm>
#define NMAX 200001
using namespace std;
struct muchie
{
    int x, y, c;
}v[NMAX], p[NMAX];
int rang[NMAX], tata[NMAX], n, k, m, s, i, px, py;
bool cmp(muchie i, muchie j)
{
    return i.c < j.c;
}
int tata_multime(int x)
{
    if(x != tata[x])
        tata[x] = tata_multime(tata[x]);
    return tata[x];
}
void unire(int x, int y)
{
    x = tata_multime(x);
    y = tata_multime(y);
    if(x != y)
    {
        if(rang[x] < rang[y])
        {
            rang[y] = rang[y] + rang[x];
            tata[x] = y;
        }
        else
        {
            rang[x] = rang[x] + rang[y];
            tata[y] = x;
        }
    }
}
int main()
{
    ifstream f("apm.in");
    ofstream g("apm.out");
    f >> n >> k;
    for(i = 1; i <= n; ++ i)
    {
        tata[i] = i;
        rang[i] = 1;
    }
    for(i = 1; i <= k; ++ i)
        f >> v[i].x >> v[i].y >> v[i].c;
    sort(v + 1, v + k + 1, cmp);
    for(i = 1; i <= k; ++ i)
    {
        px = tata_multime(v[i].x);
        py = tata_multime(v[i].y);
        if(px != py)
        {
            unire(px, py);
            p[++ m].x = v[i].x;
            p[m].y = v[i].y;
            s = s + v[i].c;
        }
    }
    g << s << "\n" << m << "\n";
    for(i = 1; i <= m; ++ i)
        g << p[i].y << " " << p[i].x << "\n";
    return 0;
}