#include <bits/stdc++.h>
using namespace std;
ifstream in("apm.in");
ofstream out("apm.out");
vector < pair <int, pair <int, int > > > v[200005];
int fr[200005];
priority_queue <pair <int, pair <int, int> > > q;
vector <pair <int, int> > rez;
int main()
{
    int n, m;
    in >> m >> n;
    for(int i = 1; i <= n; i ++)
    {
        int a, b, c;
        in >> a >> b >> c;
        v[a].push_back(make_pair(c, make_pair(a, b)));
        v[b].push_back(make_pair(c, make_pair(b, a)));
    }
    int s = 0;
    q.push(make_pair(0, make_pair(1, 1)));
    while(!q.empty())
    {
        pair <int, int> rz = q.top().second;
        int x = q.top().second.second;
        int y = -q.top().first;
        q.pop();
        if(fr[x] == 1)
            continue;
        fr[x] = 1;
        s += y;
        if(rz.second != rz.first)
            rez.push_back(make_pair(rz.second, rz.first));
        for(auto it : v[x])
        {
            if(fr[it.second.second] == 0)
            {
                int f = -it.first;
                q.push(make_pair(f, make_pair(x, it.second.second)));
            }
        }
    }
    out << s << '\n' << m - 1 << '\n';
    for(auto it : rez)
        out << it.first << " " << it.second << '\n';
    return 0;
}