#include <bits/stdc++.h>

using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");

const int N=200005;
int n,m,T[N],cost;
vector <tuple <int,int,int> > E;
vector <pair <int,int> > apm;
int getRoot(int nod)
{
    if(T[nod]==nod)
        return nod;
    T[nod]=getRoot(T[nod]);
    return T[nod];
}

int main()
{
    f>>n>>m;
    for(int i=1; i<=n; i++)
        T[i]=i;
    for(; m; m--)
    {
        int x,y,c;
        f>>x>>y>>c;
        E.push_back(make_tuple(c,x,y));

    }
    sort(E.begin(),E.end());
    for(auto it:E)
    {
        int x,y,c,rx,ry;
        tie(c,x,y)=it;
        rx=getRoot(x);
        ry=getRoot(y);
        if(rx!=ry)
        {
            cost+=c;
            apm.push_back(make_pair(x,y));
            T[rx]=ry;

        }
    }
    g<<cost<<'\n'<<n-1<<'\n';
    for(auto it:apm)
        g<<it.first<<" "<<it.second<<'\n';
    return 0;
}