#include<iostream>
#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");

//struct de muchii
struct edge{
    int x, y;
    int cost;
};

int n, m, x, y, queryType, nodes[200005], cost;
edge v[400005];
vector<edge> apm;
int sum_apm = 0;

bool cmp(edge a, edge b) {
    return a.cost < b.cost;
}

int return_rad(int x) {
    int rad = x;
    while(nodes[rad] > 0)
        rad = nodes[rad];

    while(nodes[x] > 0) {
        int father = nodes[x];
        nodes[x] = rad;
        x = father;
    }
    return rad;
}

void join(int x, int y) {
    int rad_x = return_rad(x);
    int rad_y = return_rad(y);
    if(-nodes[rad_x] > -nodes[rad_y]) {
        nodes[rad_x] += nodes[rad_y];
        nodes[rad_y] = rad_x;
    }
    else {
        nodes[rad_y] += nodes[rad_x];
        nodes[rad_x] = rad_y;
    }
}

bool verif(int x, int y) {
    int rad_x = return_rad(x);
    int rad_y = return_rad(y);
    if(rad_x == rad_y)
        return 1;
    else
        return 0;
}

int main ()
{
    fin >> n >> m;

    for (int i = 1; i <= n; i++)
    {
        nodes[i] = -1;
    }

    // citesc muchiile
    for (int i = 1; i <= m; i++)
    {
        fin >> x >> y >> cost;
        v[i] = {x, y, cost};
    }

    //sortam muchiile in functie de cost
    sort(v + 1, v + m + 1, cmp);

    for(int i = 1; i <= m; i ++) {
        if(!verif(v[i].x, v[i].y)) {
            apm.push_back(v[i]);
            sum_apm += v[i].cost;
            join(v[i].x, v[i].y);
        }
    }

    fout << sum_apm << '\n' << apm.size() << '\n';
    for(auto ed : apm) {
        fout << ed.x << " " << ed.y << '\n';
    }
    return 0;
}