#include <fstream>
#include <algorithm>

using namespace std;

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

struct ura{
    int nod1, nod2, cost;
}graf[400001];

int tata[200001];
pair<int,int> rez[400001];

bool cmp(ura x, ura y){
    if(x.cost < y.cost)
        return true;
    return false;
}

int sef(int t){
    if(tata[t] == t)
        return t;
    return tata[t] = sef(tata[t]);
}

void unire(int a, int b){
    tata[sef(a)] = sef(b);
}

int main()
{
    int n, m;
    in >> n >> m;
    for(int i = 1; i <= m; i++){
        int nd1, nd2, cst;
        in >> nd1 >> nd2 >> cst;
        graf[i].nod1 = nd1;
        graf[i].nod2 = nd2;
        graf[i].cost = cst;
    }
    for(int i = 1; i <= n; i++)
        tata[i] = i;
    sort(graf + 1, graf + m + 1, cmp);
    int sum = 0;
    int nrMuchii = 0;
    for(int i = 1; i <= m &&  nrMuchii != n - 1; i++){
        int x = sef(graf[i].nod1);
        int y = sef(graf[i].nod2);
        if(x != y){
            sum += graf[i].cost;
            nrMuchii++;
            rez[nrMuchii].first = graf[i].nod1;
            rez[nrMuchii].second = graf[i].nod2;
            unire(x, y);
        }
    }
    out << sum << "\n" << nrMuchii << "\n";
    for(int i = 1; i <= nrMuchii; i++)
        out << rez[i].first << " " << rez[i].second << "\n";
    return 0;
}