#include <fstream>
#include <algorithm>

using namespace std;

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

const int MAX_N = 200000;
const int MAX_M = 400000;

struct Edge {
    int u;
    int v;
    int c;
};

int n, m;
Edge E[1 + MAX_M];
bool usedInAPM[1 + MAX_N];
int uKey[1 + MAX_N], uRank[1 + MAX_N];

int getKey(int node) {
    if(uKey[node] != node)
        uKey[node] = getKey(uKey[node]);
    return uKey[node];
}

bool uTest(int u, int v) {
    return getKey(u) == getKey(v);
}

void unite(int u, int v) {
    int root1, root2;
    root1 = getKey(u);
    root2 = getKey(v);
    if(root1 != root2) {
        if(uRank[root1] > uRank[root2]) {
            uKey[root2] = root1;
        }
        else if(uRank[root1] < uRank[root2]) {
            uKey[root1] = root2;
        }
        else {
            uKey[root2] = root1;
            uRank[root1]++;
        }
    }
}

bool sortEdges(Edge A, Edge B) {
    return A.c < B.c;
}

int main() {
    int i, u, v, c, cost = 0, eLeft;

    in >> n >> m;
    for(i = 1; i <= m; i++)
        in >> E[i].u >> E[i].v >> E[i].c;

    for(i = 1; i <= n; i++) {
        uKey[i] = i;
        uRank[i] = 1;
    }

    sort(E + 1, E + m + 1, sortEdges);
    for(i = 1, eLeft = n - 1; eLeft && i <= m; i++) {
        u = E[i].u;
        v = E[i].v;
        if(uTest(u, v) == 0) {
            cost += E[i].c;
            usedInAPM[i] = 1;
            eLeft--;
            unite(u, v);
        }
    }

    out << cost << '\n' << n - 1 << '\n';
    for(i = 1; i <= m; i++) {
        if(usedInAPM[i]) {
            out << E[i].u << ' ' << E[i].v << '\n';
        }
    }

    return 0;
}