#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("apm.in");
ofstream cout("apm.out");
int t[200001];
struct graf
{
    int l, c, cost;
}g[400001];
bool cmp(graf a, graf b)
{
    return (a.cost < b.cost);
}
int radacina(int x)
{
    if (t[x] == x)
        return x;
    else
    {
        t[x] = radacina(t[x]);
        return t[x];
    }
}
void unire(int a, int b)
{
    int tata_a = radacina(a), tata_b = radacina(b);
    t[tata_a] = tata_b;
}
int main()
{
    graf apm[200001];
    int n, i, j, m, l = 0, cost = 0;
    //long long cost = 0;
    cin >> n >> m;
    for (i = 1; i <= m; i++)
        cin >> g[i].l >> g[i].c >> g[i].cost;
    for (i = 1; i <= n; i++)
        t[i] = i;
    sort(g + 1, g + m + 1, cmp);
    for (i = 1; i <= m; i++)
    {
        if (radacina(g[i].l) != radacina(g[i].c) && l < n - 1)
        {
            unire(g[i].l, g[i].c);
            apm[++l] = g[i];
            cost += g[i].cost;
        }
        else
            if (l == n - 1)
                break;
    }
    cout << cost << "\n" << l << "\n";
    for (i = 1; i <= l; i++)
        cout << apm[i].l << ' ' << apm[i].c << "\n";
 
   

    return 0;
}