#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream cin("apm.in");
ofstream cout("apm.out");

#define MAXN 200005

struct muchie
{
    int x,y,cost;
}act;

bool cmp(muchie A, muchie B)
{
    return A.cost < B.cost;
}

vector<muchie> v,rasp;
int GR[MAXN];
int n,m,i,j,cost_total;

int grupa(int nr)
{
    if(GR[nr]==nr)
        return nr;

    GR[nr]=grupa( GR[nr] );
    return GR[nr];
}

void reuniune(int a, int b)
{
    GR[ grupa(a) ] = grupa( b );
}
int main()
{
    cin>>n>>m;
    for(i=1; i<=m; i++)
    {
        cin>>act.x>>act.y>>act.cost;
        v.push_back(act);
    }
    for(i=1; i<=n; i++)
        GR[i] = i;
    sort(v.begin(), v.end(), cmp);
    for(i=0; i < m ; i++)
    {
        if(grupa( v[i].x ) != grupa( v[i].y ))
        {
            reuniune(v[i].x, v[i].y);
            cost_total+=v[i].cost;
            rasp.push_back(v[i]);
        }
    }

    cout<<cost_total<<"\n"<<n-1<<"\n";
    for(i=0; i<rasp.size(); i++)
        cout<<rasp[i].x<<" "<<rasp[i].y<<"\n";
    return 0;
}