#include <bits/stdc++.h>

using namespace std;

ifstream fin("apm.in");
ofstream fout("apm.out");

struct muchii
{
    int nod, nod2, cost;
    bool ales;

    bool operator < (const muchii A)const
    {
        return cost < A.cost;
    }
};

int n, m, t[200003];
muchii a[400003];

void Citire()
{
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
        fin >> a[i].nod >> a[i].nod2 >> a[i].cost;
}

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

int Find(int x)
{
    int rad, y;
    rad = x;
    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);
    int nrc = n, x, y, costm = 0, edge = 0;
    for (int i = 1; i <= m && nrc > 1; i++)
    {
        x = Find(a[i].nod);
        y = Find(a[i].nod2);
        if (x != y)
        {
            Union(x, y);
            nrc--;
            edge++;
            costm += a[i].cost;
            a[i].ales = 1;
        }
    }
    fout << costm << "\n" << edge << "\n";
    for (int i = 1; i <= m; i++)
        if (a[i].ales == 1)
            fout << a[i].nod2 << " " << a[i].nod << "\n";
}

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