#include <bits/stdc++.h>
#define oo 2e9
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
int n, m, t[200005];
struct Coord
{
    int x, y, c;
    int v;
}a[400005];

bool Cmp(Coord A, Coord B)
{
    return A.c < B.c;
}

void Union(int x, int y)
{
    t[y] = x;
}

int FindRoot(int x)
{
    int rad = x, y;
    while(t[rad] != 0)
        rad = t[rad];
    while(x != rad)
    {
        y = t[x];
        t[x] = rad;
        x = y;
    }
    return rad;
}
void Kruskal()
{
    sort(a + 1, a + m + 1, Cmp);
    int cnt = n, i, SumMax = 0, x, y;
    for(i = 1; cnt > 1; i++)
    {
        x = FindRoot(a[i].x);
        y = FindRoot(a[i].y);
        if(x != y)
        {
            Union(x, y);
            cnt--;
            SumMax += a[i].c;
            a[i].v = 1;
        }
    }
    fout << SumMax<< "\n";
    fout << n - 1 << "\n";
    for(i = 1; i <= m; i++)
    {
        if(a[i].v == 1)
            fout << a[i].y << " " << a[i].x << "\n";
    }
}
void Citire()
{
    int i, j, c, k;
    fin >> n >> m;
    for(i = 1; i <= m; i++)
    {
        fin >> a[i].x >> a[i].y >> a[i].c;
    }
    Kruskal();
}

int main()
{
    Citire();
    return 0;
}