#include <bits/stdc++.h>

using namespace std;

const int NMAX = 2e5;
const int INF = 1e9;
vector<pair<int, int>> G[NMAX + 1];
int d[NMAX + 1], vis[NMAX + 1];
int p[NMAX + 1];

int main() {
    int n, m;
    ifstream f("apm.in");
    ofstream g("apm.out");
    f >> n >> m;
    for(int i = 1; i <= m; i++) {
        int x, y, c;
        f >> x >> y >> c;
        G[x].push_back({y, c});
        G[y].push_back({x, c});
    }
    //d[i] = muchia de cost minim dintre i si apm-ul actual
    for(int i = 1; i <= n; i++) {
        d[i] = INF;
    }
    int apm = 0;
    d[1] = 0;

    set<pair<int, int>> s;
    s.insert({d[1], 1});
    while(s.size() > 0) {
        auto it = s.begin();
        int minim = (*it).first;
        int node = (*it).second;
        s.erase(it);
        vis[node] = 1;
        apm += minim;
        for(auto it : G[node]) {
            if(!vis[it.first] && d[it.first] > it.second) {
                s.erase({d[it.first], it.first});
                d[it.first] = it.second;
                s.insert({d[it.first], it.first});
                p[it.first] = node;
            }
        }
    }

    /*for(int i = 1; i <= n; i++) {
        int minim = INF;
        int node = 0;
        for(int j = 1; j <= n; j++) {
            if(!vis[j] && d[j] < minim) {
                minim = d[j];
                node = j;
            }
        }
        apm += minim;
        vis[node] = 1;
        for(auto it : G[node]) {
            if(!vis[it.first] && d[it.first] > it.second) {
                d[it.first] = it.second;
                p[it.first] = node;
            }
        }
    }*/
    g << apm << '\n';
    g << n - 1 << '\n';
    for(int i = 2; i <= n; i++) {
        g << i << ' ' << p[i] << '\n';
    }
    return 0;
}