#include <bits/stdc++.h>

using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
const int N = 200010;
int n,m,x,c,y,rx,ry,t[N],cost;
priority_queue<tuple<int,int,int>> edges;
vector<pair<int,int>>sol,v[N];
void add(int);
bitset<N> viz;
int main()
{
    f>>n>>m;
    for(;m;m--)
    {
        f>>x>>y>>c;
        v[x].push_back(make_pair(c,y));
        v[y].push_back(make_pair(c,x));
    }
    add(1);
    for(int cnt=n-1;cnt;cnt--)
    {
        do
        {
            tie(c,x,y)=edges.top();
            edges.pop();
        }
        while(viz[x]&&viz[y]);
        sol.push_back(make_pair(x,y));
        cost-=c;
        x=viz[x]?y:x;
        add(x);
    }
    g<<cost<<'\n'<<sol.size()<<'\n';
    for(auto it:sol)
        g<<it.first<<' '<<it.second<<'\n';
    return 0;
}
void add(int nod)
{
    viz[nod]=1;
    for(auto it:v[nod])
    {
        tie(c,x)=it;
        if(!viz[x])
            edges.push(make_tuple(-c,nod,x));
    }
}