#include <bits/stdc++.h>

using namespace std;

ifstream fin("apm.in");
ofstream fout("apm.out");
struct muchie {
    int i, j, c;
}a[200002], r[200002];
int n, m, i, t[200002], k, s;

static inline bool cmp(muchie a, muchie b) {
    if(a.c < b.c) return true;
    else return false;
}

static inline void unif(int a, int b) {
    t[a] = t[b];
}

static inline int rada(int a) {
    if(t[a] == a) return a;
    else return t[a] = rada(t[a]);
}

static inline void calc() {
    for(int i = 1; i <= m; i++) {
        int x = rada(a[i].i);
		int y = rada(a[i].j);

		if(t[x] != t[y]) {
            unif(x, y);
			s += a[i].c;
			r[++k] = a[i];
		}
    }
}

int main() {
    fin >> n >> m;
    for(i = 1; i <= m; i++) fin >> a[i].i >> a[i].j >> a[i].c;
    for(i = 1; i <= n; i++) t[i] = i;
    sort(a + 1, a + m + 1, cmp);
    calc();
    fout << s << "\n" << n - 1 << "\n";
	for(i = 1; i < n; i++) fout << r[i].i << " " << r[i].j << "\n";

    return 0;
}