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

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

// Determinare APM - Prim

typedef pair< int, int > iPair;

const int inf = 1e9;

vector< vector< iPair > > G;

void Prim(int n) {
    vector< int > minCost(n, inf);
    vector< int > parent(n, -1); // - Daca vrem sa printam si muchiile din APM
    vector< bool > inAPM(n, false);

    inAPM[0] = true;
    minCost[0] = 0;

    priority_queue< iPair, vector< iPair >, greater< iPair > > pq; // first - cost, second - node
    pq.push({0, 0});

    while(!pq.empty()) {
        int node = pq.top().second; pq.pop();
        inAPM[node] = true;

        for(auto vecin: G[node]) {
            if(!inAPM[vecin.first] && vecin.second < minCost[vecin.first]) {
                minCost[vecin.first] = vecin.second;
                pq.push({minCost[vecin.first], vecin.first});
                parent[vecin.first] = node;
            }
        }
    }

    int cost = 0;
    for(int i = 0; i < n; ++i) {
        if(minCost[i] != inf) {
            cost += minCost[i];
        }
    }
    out << cost << "\n";

    vector< iPair > edges;
    for(int i = 0; i < n; ++i) {
        if(parent[i] != -1) {
            edges.push_back({i + 1, parent[i] + 1});
        }
    }

    out << (int)edges.size() << "\n";
    for(auto edge: edges) {
        out << edge.first << " " << edge.second << "\n";
    }
}

int main() {

    int n, m; in >> n >> m;
    G.resize(n);

    for(int i = 1; i <= m; ++i) {
        int x, y, cost; in >> x >> y >> cost;
        G[x - 1].push_back({y - 1, cost});
        G[y - 1].push_back({x - 1, cost});
    }

    Prim(n);

    return 0;
}