#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;
vector<tuple<int,int,int>> edges;
vector<pair<int,int>>sol;
int root(int);
int main()
{
    f>>n>>m;
    for(int i=1;i<=n;i++)
        t[i]=i;
    for(;m;m--)
    {
        f>>x>>y>>c;
        edges.push_back(make_tuple(c,x,y));
    }
    sort(edges.begin(),edges.end());
    for(auto it:edges)
    {
        tie(c,x,y)=it;
        rx=root(x);
        ry=root(y);
        if(rx!=ry)
        {
            sol.push_back(make_pair(x,y));
            cost+=c;
            t[rx]=ry;
        }

    }
    g<<cost<<'\n'<<sol.size()<<'\n';
    for(auto it:sol)
        g<<it.first<<' '<<it.second<<'\n';
    return 0;
}
int root(int nod)
{
    if(t[nod]==nod)return nod;
    t[nod]=root(t[nod]);
    return t[nod];
}