#include<cstdio>
#include<algorithm>
using namespace std;
int n, m, i, tata[200001], s, nrmuc, a, b, c;

struct mama
{
    int x, y, cost;
}v[400001];

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

int findtata(int x)
{
    if(x == tata[x])
        return x;
    else
        return tata[x] = findtata(tata[x]);
}

void uniune(int x, int y)
{
    int sefx, sefy;
    sefx = findtata(x);
    sefy = findtata(y);
    tata[sefx] = sefy;
}

int main()
{
    FILE *fin, *fout;
    fin = fopen("apm.in", "r");
    fout = fopen("apm.out", "w");

    fscanf(fin, "%d%d", &n, &m);

    for(i = 1; i <= n; i ++)
        tata[i] = i;
    for(i = 1; i <= m; i ++){
        fscanf(fin, "%d%d%d", &a, &b, &c);
        v[i].x = a;
        v[i].y = b;
        v[i].cost = c;
    }
    sort(v + 1, v + m + 1, comp);
    for(i = 1; i <= m; i ++)
    {
        if(findtata(v[i].x) != findtata(v[i].y))
        {
            uniune(v[i].x, v[i].y);
            s += v[i].cost;
            nrmuc ++;
            v[i].cost = 1735;
        }
    }
    fprintf(fout, "%d\n%d\n" ,s ,nrmuc);
    for(i = 1; i <= m; i ++)
        if(v[i].cost == 1735)
            fprintf(fout, "%d %d\n" ,v[i].x ,v[i].y);

        return 0;
}