#include <fstream>
#include <vector>
#include <algorithm>
#include <iostream>

using namespace std;

struct muchie {
    int x, y, c;
    friend operator <(muchie e1, muchie e2) {
        return (e1.c < e2.c);
    }
};

vector <int> t, nr;

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

bool verif(int x, int y) {
    return (radacina(x) == radacina(y));
}

void reuniune(int x, int y) {
    int rx = radacina(x);
    int ry = radacina(y);
    if (nr[rx] < nr[ry]) {
        t[rx] = ry;
        nr[ry] += nr[rx];
    } else {
        t[ry] = rx;
        nr[rx] += nr[ry];
    }
}

int main() {
    ifstream in("apm.in");
    ofstream out("apm.out");
    int n, m;
    in >> n >> m;
    t.resize(n + 1, 0);
    nr.resize(n + 1, 1);
    vector <muchie> e(m);
    for (int i = 0; i < m; i++) {
        in >> e[i].x >> e[i].y >> e[i].c;
    }
    sort(e.begin(), e.end());
    int cost = 0;
    vector <bool> in_apm(m, false);
    for (int i = 0; i < m; i++) {
        if (!verif(e[i].x, e[i].y)) {
            in_apm[i] = true;
            cost += e[i].c;
            reuniune(e[i].x, e[i].y);
        }
    }
    out << cost << "\n" << n - 1 << "\n";
    for (int i = 0; i < m; i++) {
        if (in_apm[i]) {
            out << e[i].x << " " << e[i].y << "\n";
        }
    }
    in.close();
    out.close();
    return 0;
}