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

using namespace std;

const int N = 2e5;
const int M = 4e5;
const int INF = 1 << 10;

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

int t[N+1], nr[N+1], n, m;
bool in_apm[M];
muchie e[M];

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

int radacina(int x)
{
    if (t[x] == 0)
    {
        return x;
    }
    t[x] = radacina(t[x]);
    return t[x];
}

bool aceeasi_cc(int x, int y)
{
    return (radacina(x) == radacina(y));
}

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

int kruskal()
{
    sort(e, e + m, cmp);
    ///initializarea vectorilor t si nr
    for (int i = 1; i <= n; i++)
    {
        t[i] = 0;
        nr[i] = 1;
    }
    int nr_m_sel = 0, i = 0, cost_total = 0;
    while (nr_m_sel < n - 1)
    {
        if (!aceeasi_cc(e[i].x, e[i].y))
        {
            in_apm[i] = true;
            cost_total += e[i].cost;
            reuniune(e[i].x, e[i].y);
            nr_m_sel++;
        }
        i++;
    }
    return cost_total;
}

int main()
{
    ifstream in("apm.in");
    ofstream out("apm.out");
    in >> n >> m;
    for (int i = 0; i < m; i++)
    {
        in >> e[i].x >> e[i].y >> e[i].cost;
    }
    out << kruskal() << "\n" << n - 1 << "\n";
    for (int i = 0; i < m; i++)
    {
        if (in_apm[i])
        {
            out << e[i].x << " " << e[i].y << "\n";
        }
    }
    in.close();
    out.close();
    return 0;
}