#include <bits/stdc++.h>
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
/// kruskal
const int N = 200010;
int n,m,c,x,y,costAPM;
priority_queue<tuple<int,int,int>> pq;
vector<pair<int,int>> v[N],sol;
bitset<N> used;
int main()
{
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        f>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
        v[y].push_back(make_pair(x,c));
    }
    used[1]=1;
    for(auto it:v[1])
    {
        tie(x,c)=it;
        pq.push(make_tuple(-c,1,x));
    }
    m=n-1;
    while(m)
    {

        tie(c,x,y)=pq.top();pq.pop();
        if(used[y])
            continue;
        ///if(used[x])swap(x,y);

        m--;
        costAPM-=c;
        sol.push_back(make_pair(x,y));
        used[y]=1;
        for(auto it:v[y])
        {
            tie(x,c)=it;
            if(!used[x])
                pq.push(make_tuple(-c,y,x));
        }
    }
    g<<costAPM<<'\n'<<n-1<<'\n';
    for(auto it:sol)
        g<<it.first<<' '<<it.second<<'\n';
    return 0;
}