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

using namespace std;

int GROUP (int i);
void reunion (int i, int j);
bool compare (int i, int j);

int N, M;
int X[400001], Y[400001];
int C[400001];

int pos[400001], group[200001];
int i;

int sol1, sol2;
vector <int> sol3;

int main ()
{
    ifstream fin ("apm.in");
    fin >> N >> M;
    for (i=1; i<=M; i++)
        fin >> X[i] >> Y[i] >> C[i];
    fin.close();
    for (i=1; i<=M; i++)
        pos[i] = i;
    for (i=1; i<=N; i++)
        group[i] = i;
    sort(pos+1,pos+M+1,compare);
    for (i=1; i<=M; i++)
        if (GROUP(X[pos[i]]) != GROUP(Y[pos[i]]))
        {
            sol1 += C[pos[i]];
            reunion(X[pos[i]],Y[pos[i]]);
            sol3.push_back(pos[i]);
        }
    sol2 = N - 1;
    ofstream fout ("apm.out");
    fout << sol1 << '\n';
    fout << sol2 << '\n';
    for (i=0; i<sol2; i++)
        fout << X[sol3[i]] << ' ' << Y[sol3[i]] << '\n';
    fout.close();
    return 0;
}

bool compare (int i, int j)
{
    return (C[i] < C[j]);
}

int GROUP (int i)
{
    if (group[i] == i)
        return i;
    group[i] = GROUP(group[i]);
    return group[i];
}

void reunion (int i, int j)
{
    group[GROUP(i)] = GROUP(j);
}