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

ifstream f("apm.in");
ofstream g("apm.out");
const int M = 400001;
int t[M];
int folosit[M];
struct muchie
{
    int x, y, c;
};
muchie v[M];
bool cmp(muchie e1, muchie e2)
{
    return (e1.c < e2.c);
}
int radacina(int x)
{
    if (t[x] == 0)
        return x;
    t[x] = radacina(t[x]);
    return t[x];
}
void reuniune(int x, int y)
{
    int rx = radacina(x), ry = radacina(y);
    if (rx == ry)
        return;
    if (rx < ry)
    {
        t[rx] = ry;
    }
    else {
        t[ry] = rx;
    }
}
bool interogare(int x, int y)
{
    return (radacina(x) == radacina(y));
}
int main()
{
    int n, p, cnt = 0, cost = 0;
    f >> n >> p;
    for (int i = 1; i <= p; i++)
    {
        f >> v[i].x >> v[i].y >> v[i].c;
    }
    sort(v + 1, v + p + 1, cmp);
    for (int i = 1; i <= p; i++)
    {
        if (interogare(v[i].x, v[i].y))
            continue;
        folosit[i] = true;
        cost += v[i].c;
        reuniune(v[i].x, v[i].y);
        cnt++;
    }
    g << cost << '\n' << cnt << '\n';
    for (int i = 1; i <= p; i++)
    {
        if (folosit[i])
            g << v[i].y << ' ' << v[i].x << '\n';
    }
    f.close();
    g.close();
    return 0;
}