#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

struct drum
{
    int nod1, nod2, cost;
};

drum v[400001];

struct sol
{
    int n1, n2;
};

sol s[200001];

int tati[200001];

int i, n, m, costmin, nrsol;

bool cmp(drum a, drum b)
{
    if(a.cost<b.cost)
        return true;
    return false;
}

int tata(int nod)
{
    if(tati[nod]==nod)
        return nod;
    else
        return tati[nod]=tata(tati[nod]);
}

void join(int nod, int node)
{
    int rx, ry;
    rx=tata(nod);
    ry=tata(node);
    tati[rx]=ry;
}

int main()
{
	freopen("apm.in", "r", stdin);
	freopen("apm.out", "w", stdout);
	scanf("%d%d", &n, &m);
    for(i=1; i<=n; i++)
        tati[i]=i;
    for(i=1; i<=m; i++)
		scanf("%d%d%d", &v[i].nod1, &v[i].nod2, &v[i].cost);
    sort(v+1, v+m+1, cmp);
    i=1;
    nrsol=1;
    while(nrsol<n && i<=m)
    {
        if(tati[tata(v[i].nod1)]!=tati[tata(v[i].nod2)])
        {
            s[nrsol].n1=v[i].nod1;
            s[nrsol].n2=v[i].nod2;
            join(s[nrsol].n1, s[nrsol].n2);
            costmin=costmin+v[i].cost;
            nrsol++;
        }
        i++;
    }
    nrsol--;
    printf("%d\n%d\n", costmin, nrsol);
    for(i=1; i<=nrsol; i++)
		printf("%d %d\n", s[i].n2, s[i].n1);
    return 0;
}