#include <bits/stdc++.h>
/// Arbore partial de cost minim
/// Algoritmul Kruskal
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
const int N = 100010;
int n,m,c,x,y,cost,T[N],getRoot(int);
vector<tuple<int,int,int>> e;
vector<pair<int,int>>apm;
int main()
{
    f>>n>>m;
    for(int i=1;i<=n;i++)
        T[i]=i;
    for(int i=1;i<=m;i++)
    {
        f>>x>>y>>c;
        e.push_back(make_tuple(c,x,y));
    }
    sort(e.begin(),e.end());
    for(auto it:e)
    {
        tie(c,x,y)=it;
        int rx=getRoot(x);
        int ry=getRoot(y);
        if(rx!=ry)
        {
            apm.push_back(make_pair(x,y));
            cost+=c;
            T[rx]=ry;
        }
    }
    g<<cost<<'\n'<<apm.size()<<'\n';
    for(auto it:apm)
        g<<it.first<<' '<<it.second<<'\n';
    return 0;
}
int getRoot(int nod)
{
    if(T[nod]==nod)return nod;
    T[nod]=getRoot(T[nod]);
    return T[nod];
}