#include <bits/stdc++.h>

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

int t[200005], n, m;

struct tr{
    int x, y, cost, viz;
}a[400005];

inline bool Cmp(const tr A, const tr B)
{
    return A.cost < B.cost;
}

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

int Find(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 Citire()
{
    int x, y, op;
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
        fin >> a[i].x >> a[i].y >> a[i].cost;

    sort(a + 1, a + m + 1, Cmp);

    int costmin = 0;
    for(int i = 1; i <= m; i++)
    {
        x = Find(a[i].x);
        y = Find(a[i].y);

        if(x != y)
        {
            a[i].viz = 1;
            costmin += a[i].cost;
            Union(x, y);
        }
    }

    fout << costmin << "\n";
    fout << n - 1 << "\n";

    for(int i = 1; i <= m; i++)
        if(a[i].viz)
            fout << a[i].x << " " << a[i].y << "\n";
}

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