#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <queue>

using namespace std;

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



bool used[200001];
vector<pair<int, int> > V[200001];
priority_queue<pair<int, pair<int, int> > > Q;
pair<int, int> sol[200001];
int n,m;
int cost;

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,c;
        fin>>x>>y>>c;
        c*=-1;
        V[x].push_back(make_pair(y,c));
        V[y].push_back(make_pair(x,c));
    }
    int nod = 1;

    for(int i=1;i<n;i++)
    {
        used[nod] = true;
        for(vector<pair<int, int> >::iterator it = V[nod].begin(); it!= V[nod].end(); it++)
        {
            if(!used[it->first])
            {
                Q.push(make_pair(it->second, make_pair(nod, it->first)));
            }
        }
        while(used[ Q.top().second.second ])
            Q.pop();

        pair<int,pair<int,int> >  F = Q.top();
        sol[i] = F.second;
        cost += F.first;
        if(used[sol[i].first])
            nod = sol[i].second;
        else nod = sol[i].first;
    }

    fout<<-cost<<'\n'<<n-1<<'\n';
    for(int i=1;i<n;i++)
        fout<<sol[i].first<<' '<<sol[i].second<<'\n';

    fin.close();
    fout.close();
    return 0;
}