#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

bool cmp(muchie e1, muchie e2)
{
    return (e1.c < e2.c);
}

int radacina(vector <int> &t, int x)
{
    if (t[x] == 0)
    {
        return x;
    }
    t[x] = radacina(t, t[x]);
    return t[x];
}

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

bool aceeasi_multime(vector <int> &t, int x, int y)
{
    return (radacina(t, x) == radacina(t, y));
}

int main()
{
    ifstream in("apm.in");
    ofstream out("apm.out");
    int n, m;
    in >> n >> m;
    vector <muchie> e(m);
    for (int i = 0; i < m; i++)
    {
        in >> e[i].x >> e[i].y >> e[i].c;
    }
    sort(e.begin(), e.end(), cmp);
    vector <bool> folosit(m, false);
    vector <int> t(n + 1, 0);
    vector <int> nr(n + 1, 1);
    int cost_total = 0;
    for (int i = 0; i < m; i++)
    {
        if (!aceeasi_multime(t, e[i].x, e[i].y))
        {
            reuniune(t, nr, e[i].x, e[i].y);
            cost_total += e[i].c;
            folosit[i] = true;
        }
    }
    out << cost_total << "\n" << n - 1 << "\n";
    for (int i = 0; i < m; i++)
    {
        if (folosit[i])
        {
            out << e[i].x << " " << e[i].y << "\n";
        }
    }
    in.close();
    out.close();
    return 0;
}