#include<bits/stdc++.h>
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
vector<tuple<int,int,int>> muchii;
vector<pair<int,int>> apm;
int n,m,i,x,y,c,rx,ry,cost,T[101],nr_muchii;
int get_root(int nod)
{
    if(T[nod]==nod)return nod;
    T[nod]=get_root(T[nod]);
    return T[nod];
}
int main()
{
    f>>n>>m;
    for(i=1;i<=n;i++)
        T[i]=i;
    for(;m;m--)
    {
        f>>x>>y>>c;
        muchii.push_back(make_tuple(x,y,c));
    }
    sort(muchii.begin(),muchii.end());
    m=n-1;
    for(auto it:muchii)
    {
        tie(x,y,c)=it;
        rx=get_root(x);
        ry=get_root(y);
        if(rx!=ry)
        {
            cost+=c;
            apm.push_back(make_pair(x,y));
            T[rx]=ry;
            m--;
            if(!m)
            {
                g<<cost<<'\n';
                for(auto mu:apm)
                    nr_muchii++;
                    g<<nr_muchii<<'\n';
                for(auto mu:apm)
                    g<<mu.first<<' '<<mu.second<<'\n';
                return 0;
            }
        }
    }

  return 0;
}