#include <cstdio>
#include <cstring>
#include <algorithm>
#define NMAX 200007
FILE *fin, *fout;
using namespace std;
int n, m, pmd[NMAX], sol[2*NMAX], ct = 1, sum = 0;
struct muchie
{
    int a;
    int b;
    int cost;
} v[2*NMAX];
bool comp(muchie x, muchie y)
{
    return x.cost < y.cost;
}
int root(int x)
{
    int rx = x;
    while(pmd[rx] > 0)
    {
        rx = pmd[rx];
    }
    while(x!=rx)
    {
        int aux = pmd[x];
        pmd[x] = rx;
        x = aux;
    }
    return rx;
}
int unit(int x, int y)
{
    int rx = root(x), ry = root(y);
    if(pmd[rx] < pmd[ry]) {pmd[rx] += pmd[ry]; pmd[ry] = rx;}
    else {pmd[ry] += pmd[rx]; pmd[rx] = ry;}
}
bool query(int x, int y)
{
    return root(x) == root(y);
}
int main()
{
    fin = freopen("apm.in", "r", stdin);
    fout = freopen("apm.out", "w", stdout);
    scanf("%d %d", &n, &m);
    for(int i = 1; i<= m; ++i) scanf("%d %d %d", &v[i].a, &v[i].b, &v[i].cost);
    sort(v+1, v+m+1, comp);
    memset(pmd, -1, sizeof(pmd));
    for(int i = 1; i<= m; ++i)
    {
        if(query(v[i].a, v[i].b) == 0)
        {
            sum += v[i].cost;
            sol[ct] = i;
            ++ct;
            unit(v[i].a, v[i].b);
        }
    }
    printf("%d\n", sum);
    printf("%d\n", ct-1);
    for(int i = 1; i< ct; ++i) printf("%d %d\n", v[sol[i]].a, v[sol[i]].b);
    fclose(fin);
    fclose(fout);
    return 0;
}