#include <bits/stdc++.h>
#define ll long long
#define INF 0x3F3F3F3F
using namespace std;

const string fisier = "apm";

ifstream fin (fisier + ".in");
ofstream fout (fisier + ".out");

const int N_MAX = 2e5 + 5;

struct arbore{
    int x , y , cost;
};

arbore g[N_MAX];
int n , m , ans , t[N_MAX] , cnt;

int compar (arbore a , arbore b){
    if (a.cost == b.cost){
        return a.x <= b.x;
    }
    return a.cost < b.cost;
}

int root (int x){
    int node = x;
    while (x != t[x]){
        x = t[x];
    }
    t[node] = x;
    return x;
}

void disjoint (int x , int y){
    int tx = root(x) , ty = root(y);
    if (tx != ty){
        t[tx] = ty;
    }
}

int main(){
    ios_base::sync_with_stdio(false);
    fin >> n >> m;
    for (int i=1; i<=m; i++){
        fin >> g[i].x >> g[i].y >> g[i].cost;
    }
    sort(g + 1 , g + m + 1 , compar);
    for (int i=1; i<=n; i++){
        t[i] = i;
    }
    for (int i=1; i<=m; i++){
        if (root(g[i].x) != root(g[i].y)){
            ans += g[i].cost;
            cnt += 1;
            g[i].cost = INF;
            disjoint(g[i].x , g[i].y);
        }
    }
    fout << ans << '\n' << cnt << '\n';
    for (int i=1; i<=m; i++){
        if (g[i].cost == INF){
            fout << g[i].x << " " << g[i].y << '\n';
        }
    }
}