#include<fstream>
#include<algorithm>
using namespace std;

ifstream cin("apm.in");
ofstream cout("apm.out");

struct muchie
{
    int x, y, cost;
}v[400001], apm[200001];
int s, tata[200001], n, m, i, j;

bool comp(muchie a,muchie b)
{
    return a.cost < b.cost;
}

int radacina(int nod)
{
    if(!tata[nod])
        return nod;
    tata[nod]=radacina(tata[nod]);
    return tata[nod];
}

int main()
{
    cin>>n>>m;
    for(i=1; i<=m; i++)
        cin>>v[i].x>>v[i].y>>v[i].cost;
    sort(v+1, v+m+1, comp);
    for(i=1, j=1; i<=m && j<n; i++)
        if(radacina(v[i].x) != radacina(v[i].y))
            {
                tata[radacina(v[i].x)]=radacina(v[i].y);
                apm[j++]=v[i];
                s+=v[i].cost;
            }
    cout<<s<<'\n'<<n-1<<'\n';
    for(i=1; i<n; i++)
        cout<<apm[i].x<<" "<<apm[i].y<<'\n';
    return 0;
}