#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#define M 400000
#define N 200001

typedef struct muchie muchie;

struct muchie
{
    int x, y, c;
};

muchie v[M];
int t[N], nr[N];
bool selectat[M];

int cmp(const void *p1, const void *p2)
{
    muchie e1 = *(muchie*)p1;
    muchie e2 = *(muchie*)p2;
    return (e1.c - e2.c);
}

int radacina(int x)
{
    if (t[x] == 0)
    {
        return x;
    }
    //return radacina(t[x]);
    t[x] = radacina(t[x]);
    return t[x];
}

void reuniune(int x, int y)
{
    int rx = radacina(x);
    int ry = radacina(y);
    if (nr[rx] < nr[ry])
    {
        t[rx] = ry;
        nr[ry] += nr[rx];
    }
    else
    {
        t[ry] = rx;
        nr[rx] += nr[ry];
    }
}

bool aceeasi_multime(int x, int y)
{
    return (radacina(x) == radacina(y));
}

int main()
{
    FILE *in, *out;
    int m, n, i;
    in = fopen("apm.in", "r");
    out = fopen("apm.out", "w");
    fscanf(in, "%d%d", &n, &m);
    for (i = 0; i < m; i++)
    {
        fscanf(in, "%d%d%d", &v[i].x, &v[i].y, &v[i].c);
    }
    qsort(v, m, sizeof(muchie), cmp);
    for (i = 1; i <= n; i++)
    {
        nr[i] = 1;
    }
    int cost = 0;
    for (i = 0; i < m; i++)
    {
        if (!aceeasi_multime(v[i].x, v[i].y))
        {
            cost += v[i].c;
            selectat[i] = true;
            reuniune(v[i].x, v[i].y);
        }
    }
    fprintf(out, "%d\n%d\n", cost, n - 1);
    for (i = 0; i < m; i++)
    {
        if (selectat[i])
        {
            fprintf(out, "%d %d\n", v[i].x, v[i].y);
        }
    }
    fclose(in);
    fclose(out);
    return 0;
}