/*
 * Lefter Sergiu - 25/05/2023
*/
#include <fstream>
#include <vector>
#include <bitset>
#include <queue>

using namespace std;

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

const int N = 2e5;
const int INF = 1e9;

struct vecin {
    int vf, cost;
};

int n, m, total;
vector <vecin> a[N + 1];
vector <int> pred;

void prim() {
    vector <int> d(n + 1);
    pred.resize(n + 1);
    bitset <N + 1> selectat;
    d[1] = 0;
    for (int i = 2; i <= n; ++i) {
        d[i] = INF;
    }
    priority_queue <pair <int, int>> pq;
    pq.push({0, 1});
    while (!pq.empty()) {
        int x = pq.top().second;
        pq.pop();
        if (selectat[x]) { //inseamna ca am stabilit totul despre el
            continue;
        }
        selectat[x] = 1;
        total += d[x];
        for (auto v: a[x]) { //v = vecin
            int y = v.vf, c = v.cost;
            if (selectat[y]) {
                continue;
            }
            if (c < d[y]) { //cea mai avantajoasa metoda de conectare a lui y e prin x-y
                d[y] = c;
                pred[y] = x;
                pq.push({-d[y], y});
            }
        }
    }
}

int main() {
    in >> n >> m;
    for (int i = 1; i <= m; ++i) {
        int x, y, c;
        in >> x >> y >> c;
        a[x].push_back({y, c});
        a[y].push_back({x, c});
    }
    prim(); //calc total si construire vector pred
    out << total << '\n' << n - 1 << '\n'; //n - 1 = numarul de muchii ale APM ului
    for (int i = 2; i <= n; ++i) {
        out << pred[i] << " " << i << '\n';
    }
    return 0;
}