#include <stdio.h>
#include <algorithm>
using namespace std;

struct muchie
{
    int x, y;
    int cost;
}v[400001], sol[400001];
int parinte[200001], n, m;

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

void init()
{
    for(int i = 1; i <= n; i++)
        parinte[i] = i;
}

int find(int x)
{
    int ans = x;
    while(ans != parinte[ans])
        ans = parinte[ans];
    while(parinte[x] != ans)
    {
        int tmp = parinte[x];
        parinte[x] = ans;
        x = tmp;
    }
    return ans;
}

void join(int x, int y)
{
    x = find(x);
    y = find(y);
    parinte[x] = y;
}


int main()
{
    FILE *fin, *fout;

    fin = fopen("apm.in", "r");
    fout = fopen("apm.out", "w");

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

    for(int i = 1; i <= m; i++)
    {
        int x, y, c;
        fscanf(fin, "%d%d%d", &x, &y, &c);
        v[i] = {x, y, c};
    }

    sort(v + 1, v + m + 1, cmp);

    int cost = 0, nr = 0;
    init();

    for(int i = 1; i <= m; i++)
    {
        int x = v[i].x, y = v[i].y, c = v[i].cost;
        if(find(x) != find(y))
        {
            join(x, y);
            sol[++nr] = {x, y, 0};
            cost += c;
        }
    }

    fprintf(fout, "%d\n%d\n", cost, nr);
    for(int i = 1; i <= nr; i++)
        fprintf(fout, "%d %d\n", sol[i].x, sol[i].y);

    return 0;
}