#include <bits/stdc++.h>
using namespace std;

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

const int nmax = 200005;

int n, m, cost_final, nr_el;
int comp[nmax], t[nmax];

struct muchie
{
    int x, y, cost;
     bool operator < (const muchie &A) const
    {
        return cost < A.cost;
    }
}apm[nmax];

muchie M[2 * nmax];

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

int Find(int x)
{
    int rad = x,y;
    while(t[rad] > 0)
        rad = t[rad];
    while(t[x] > 0)
    {
        y = t[x];
        t[x] = rad;
        x = y;
    }
    return rad;
}

void solve()
{
    for(int i = 1; i <= n; i ++)
    {
        t[i] = -1;
        comp[i] = i;
    }

    for(int i = 1; i <= m; i ++)
    {
        if(Find(M[i].x) != Find(M[i].y))
        {
            Union(Find(M[i].x), Find(M[i].y));
            cost_final += M[i].cost;
            apm[++nr_el] = M[i];
        }
    }

    fout << cost_final<< "\n" << n - 1 << '\n';

    for(int i = 1; i <= n - 1; i ++)
    {
        fout << apm[i].y << " " << apm[i].x << '\n';
    }
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i ++)
    {
        fin >> M[i].x >> M[i].y >> M[i].cost;
    }
    sort(M + 1, M + m + 1);

    solve();
    return 0;
}