#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>
#include <string.h>
#include <queue>

using namespace std;

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

const int maxn = 100005;
const int oo = 0x3f3f3f3f;

int n, m, dist[maxn];
vector <pair<int, pair<int, int> > > v;
vector <pair<int, int> > g[maxn];
vector <int> father;
bitset <maxn> used;

inline int _find(int x) {
    if(father[x] != x)
        father[x] = _find(father[x]);
    return father[x];
}

inline void kruskal() {
    vector <pair<int, int> > apm;
    int total = 0;
    sort(v.begin(), v.end());
    father.resize(n);
    for(int i = 0 ; i < n ; ++ i)
        father[i] = i;
    for(int i = 0 ; i < v.size() ; ++ i) {
        int x = _find(v[i].second.first - 1);
        int y = _find(v[i].second.second - 1);
        if(x != y) {
            father[x] = y;
            total += v[i].first;
            apm.push_back(v[i].second);
        }
    }
    fout << total << '\n' << apm.size() << "\n";
    for(vector <pair<int, int> > :: iterator it = apm.begin() ; it != apm.end() ; ++ it)
        fout << it->first << ' ' << it->second << '\n';
}

inline void prim() {
    memset(dist, oo, sizeof(dist));
    dist[1] = 0;
    priority_queue <pair<int, int> > q;
    vector <pair<int, int> > apm;
    q.push(make_pair(0, 1));
    father.resize(n + 2);
    int total = 0;
    while(!q.empty()) {
        int node = q.top().second;
        int cost = -q.top().first;
        used[node] = 1;
        q.pop();
        if(dist[node] < cost)
            continue;
        for(vector <pair<int, int> > :: iterator it = g[node].begin() ; it != g[node].end() ; ++ it)
            if(!used[it->first] && dist[it->first] > it->second) {
                dist[it->first] = it->second;
                father[it->first] = node;
                q.push(make_pair(-dist[it->first], it->first));
            }
        total += dist[node];
        apm.push_back(make_pair(father[node], node));
        //while(!q.empty() && used[q.top().second])
        //    q.pop();
    }
    fout << total << '\n' << n - 1 << '\n';
    for(int i = 1 ; i < apm.size() ; ++ i)
        fout << apm[i].first << ' ' << apm[i].second << '\n';
}

int main() {
    fin >> n >> m;
    for(int i = 1 ; i <= m ; ++ i) {
        int x, y, z;
        fin >> x >> y >> z;
        v.push_back(make_pair(z, make_pair(x, y)));
        g[x].push_back(make_pair(y, z));
        g[y].push_back(make_pair(x, z));
    }
    prim();
    ///kruskal();
}