#include <fstream>
#include <algorithm>

using namespace std;

const int N = 2e5;
const int M = 4e5;

struct muchie {
    int x, y, c;
};

muchie v[M];
bool selectat[M];
int t[N+1], nr[N+1];

bool cmp(muchie m1, muchie m2) {
    return (m1.c < m2.c);
}

int radacina(int x) {
    if (t[x] == 0) {
        return x;
    }
    t[x] = radacina(t[x]);
    return t[x];
}

int main() {
    ifstream in("apm.in");
    ofstream out("apm.out");
    int n, m;
    in >> n >> m;
    for (int i = 1; i <= n; i++) {
        nr[i] = 1;
    }
    for (int i = 0; i < m; i++) {
        in >> v[i].x >> v[i].y >> v[i].c;
    }
    in.close();
    sort(v, v + m, cmp);
    int i = 0, nr_m = 0, cost_total = 0;
    while (nr_m < n - 1) {
        int rx = radacina(v[i].x);
        int ry = radacina(v[i].y);
        if (rx != ry) {
            nr_m++;
            selectat[i] = true;
            cost_total += v[i].c;
            if (nr[rx] < nr[ry]) {
                t[rx] = ry;
                nr[ry] += nr[rx];
            } else {
                t[ry] = rx;
                nr[rx] += nr[ry];
            }
        }
        i++;
    }
    out << cost_total << "\n" << n - 1 << "\n";
    for (int i = 0; i < m; i++) {
        if (selectat[i]) {
            out << v[i].x << " " << v[i].y << "\n";
        }
    }
    out.close();
    return 0;
}