#include <bits/stdc++.h>
#define int long long
using namespace std;

struct edge{
    int from, to, cost;
    bool operator <(const edge &a) const{
        return cost < a.cost;
    }
}v[400005];

int lead[200005], siz[200005];

int find(int u){
    if(lead[u] == u) return u;
    return lead[u] = find(lead[u]);
}
void unite(int u, int v){
    u = find(u);
    v = find(v);
    if(u == v) return;
    if(siz[u] < siz[v]) swap(u, v);
    lead[v] = u;
    siz[u] += siz[v];
}

signed main(){
    
    ifstream cin("apm.in");
    ofstream cout("apm.out");
    
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        lead[i] = i;
        siz[i] = 1;
    }
    for(int i = 1; i <= m; i++){
        cin >> v[i].from >> v[i].to >> v[i].cost;
    }
    sort(v + 1, v + m + 1);
    int ans = 0;
    vector<pair<int, int>> edges;
    for(int i = 1; i <= m; i++){
        int a = v[i].to, b = v[i].from;
        v[i].to = find(v[i].to);
        v[i].from = find(v[i].from);
        if(v[i].to == v[i].from)
            continue;
        ans += v[i].cost;
        unite(v[i].to, v[i].from);
        edges.push_back({a, b});
    }
    cout << ans << '\n' << n - 1 << '\n';
    for(auto [a, b] : edges){
        cout << a << " " << b << '\n';
    }
    return 0;
}