#include <bits/stdc++.h>
using namespace std;

void file_in(string name) {
    freopen((name + ".in").c_str(), "r", stdin);
    freopen((name + ".out").c_str(), "w", stdout);
}

struct edge {
    int to, cost;
};

using ll = long long;

const ll INF64 = (2e18) + 5;
const int N = 200200;

int n, total = 0;
vector<edge> g[N];
vector<int> pred;

void prim() {
    vector<ll> d(n + 1, INF64);
    pred.resize(n + 1);
    bitset<N> sel;

    d[1] = 0;

    priority_queue<pair<int, int>> h;
    h.push({0, 1});

    while(!h.empty()) {
        int u = h.top().second;
        h.pop();

        if(sel[u])
            continue;
        
        sel[u] = 1;
        total += d[u];

        for(auto e : g[u]) {
            int v = e.to, w = e.cost;
            if(sel[v])
                continue;
            if (w < d[v]) {
                d[v] = w;
                pred[v] = u;
                h.push({-w, v});
            }
        }
    }
}

int main() {
    file_in("apm");

    int m;
    cin >> n >> m;

    for(int i = 0; i < m; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        g[u].push_back({v, w});
        g[v].push_back({u, w});
    }

    prim();

    cout << total << '\n' << n - 1 << '\n';
    for(int i = 2; i <= n; i++) {
        cout << pred[i] << " " << i << '\n';
    }

    return 0;
}