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

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

priority_queue <pair <int, int> > q;
priority_queue <pair <int, int> > q2;
vector <pair <int, int> > v[200005];
vector <pair <int, int> > b;

int n, m, e, s;
bool a[200005];

int main()
{
    f>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int x, y, c;
        f>>x>>y>>c;
        v[x].push_back(make_pair(y, c));
        v[y].push_back(make_pair(x, c));
    }
    a[1]=1;
    for(int i=0; i<v[1].size(); i++)
    {
        q.push(make_pair(-v[1][i].second, v[1][i].first));
        q2.push(make_pair(-v[1][i].second, 1));
    }
    e=1;
    while(e<n)
    {
        int vecin=q.top().second;
        int cost=-q.top().first;
        while(a[vecin]==1)
        {
            q.pop();
            q2.pop();
            vecin=q.top().second;
            cost=-q.top().first;
        }
        int anterior=q2.top().second;
        b.push_back(make_pair(anterior, vecin));
        a[vecin]=1;
        e++;
        s+=cost;
        q.pop();
        q2.pop();
        for(int i=0; i<v[vecin].size(); i++)
        {
            int aux= v[vecin][i].first;
            if(!a[aux]){
            q.push(make_pair(-v[vecin][i].second, v[vecin][i].first));
            q2.push(make_pair(-v[vecin][i].second, vecin));}
        }
    }
    g<<s<<'\n'<<e-1<<'\n';
    for(int i=0; i<e-1; i++)
    {
        g<<b[i].first<<" "<<b[i].second<<'\n';
    }
    return 0;
}