#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

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

const int maxn = 100005;

int n, m;
vector <pair<int, pair<int, int> > > v;
vector <int> father;

inline int _find(int x) {
    if(father[x] != x)
        father[x] = _find(father[x]);
    return father[x];
}

inline void kruskal() {
    vector <pair<int, int> > apm;
    int total = 0;
    sort(v.begin(), v.end());
    father.resize(n);
    for(int i = 0 ; i < n ; ++ i)
        father[i] = i;
    for(int i = 0 ; i < v.size() ; ++ i) {
        int x = _find(v[i].second.first - 1);
        int y = _find(v[i].second.second - 1);
        if(x != y) {
            father[x] = y;
            total += v[i].first;
            apm.push_back(v[i].second);
        }
    }
    fout << total << '\n' << apm.size() << "\n";
    for(vector <pair<int, int> > :: iterator it = apm.begin() ; it != apm.end() ; ++ it)
        fout << it->first << ' ' << it->second << '\n';
}

int main() {
    fin >> n >> m;
    for(int i = 1 ; i <= m ; ++ i) {
        int x, y, z;
        fin >> x >> y >> z;
        v.push_back(make_pair(z, make_pair(x, y)));
    }
    kruskal();
}