#include <bits/stdc++.h>
#define N 100005
using namespace std;

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

vector<pair<int, int>> apm;
vector<pair<int, int>> g[N];
int viz[N], d[N], t[N];
int n, m;

void afis(){
    for(int i = 1; i <= n; ++i){
        fout << i << ' ';
        for(auto nod : g[i]){
            fout << nod.first << " " << nod.second;
        }
        fout << '\n';
    }
}

void Prim(){
    /// s este nodul de unde incepe treaba
    int start = 1, sum = 0;
    for(int i = 1; i <= n; ++i)
        d[i] = INT_MAX, t[i] = 0;
    d[start] = 0;

    for(int ii = 1; ii <= n; ++ii){
        int vmin = INT_MAX, nodmin;
        for(int i = 1; i <= n; ++i){
            if(d[i] < vmin && !viz[i])
                vmin = d[i], nodmin = i;
        }

        viz[nodmin] = 1;
        if(nodmin != start)
            apm.emplace_back(nodmin, t[nodmin]);
        sum += vmin;

        for(auto pair : g[nodmin]){
            int nod = pair.first, cost = pair.second;
            if(!viz[nod] && cost < d[nod]){
                d[nod] = cost, t[nod] = nodmin;
            }
        }
    }
    fout << sum <<'\n' << n-1 << '\n';
    for(auto pair : apm){
        fout << pair.first << ' ' << pair.second <<'\n';
    }
}

int main() {
    fin >> n >> m;
    for(int i = 0; i < m; ++i){
        int x, y, z;
        fin >> x >> y >> z;
        g[x].emplace_back(y,z);
        g[y].emplace_back(x, z);
    }
    Prim();
    return 0;
}