#include <bits/stdc++.h>

using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
const int nMax = 200003;
int Tata[nMax];
struct Po{
    int x, y, cost;
};
inline bool cmp(const Po A, const Po B) {
    return A.cost < B.cost;
}
Po a[nMax], rec[nMax];
inline void Union(int x, int y) {
    Tata[x] = y;
}
inline int Find(int x) {
    if(Tata[x] != x) {
        Tata[x] = Find(Tata[x]);
    }
    return Tata[x];
}
int main()
{
    int n, m;
    f >> n >> m;
    for(int i = 1; i <= m; i++) {
        f >> a[i].x >> a[i].y >> a[i].cost;
    }
    for(int i = 1; i <= n; i++) {
        Tata[i] = i;
    }
    sort(a + 1, a + m + 1, cmp);
    int ans = 0, cnt = 0;
    for(int i = 1; i <= m; i++) {
        int xx = Find(a[i].x);
        int yy = Find(a[i].y);
        if(xx != yy) {
            ans += a[i].cost;
            Union(xx, yy);
            cnt++;
            rec[cnt].x = a[i].x;
            rec[cnt].y = a[i].y;
        }
    }
    g << ans << "\n";
    g << cnt << "\n";
    for(int i =1; i < n; i++) {
        g << rec[i].y << " " << rec[i].x << "\n";
    }
    return 0;
}