#include <iostream>
#include<fstream>
#include<algorithm>
using namespace std;
ifstream    fin("apm.in");
ofstream    fout("apm.out");
const int NMax = 400005;
pair <int, int> P[NMax];
int N, M, TT[NMax], RG[NMax], k, Total, i;
struct Muchie
{
    int x, y, cost;
} V[NMax];
bool Compare(Muchie a, Muchie b)
{
    return a.cost < b.cost;
}
void Citire()
{
    fin >> N >> M;
    for (i = 1; i <= M; i++)
        fin >> V[i].x >> V[i].y >> V[i].cost;
    sort(V + 1, V + M + 1, Compare);
    for (i = 1; i <= N; i++)
    {
        RG[i] = 1;
        TT[i] = i;
    }
}
void Afisare()
{
    fout << Total << "\n";
    fout << N - 1 << "\n";
    for (i = 1; i <= k; i++)
        fout << P[i].first << ' ' << P[i].second << "\n";
}
int VerificareTata(int Nod)
{
    while (TT[Nod] != Nod)
    {
        Nod = TT[Nod];
    }
    return Nod;
}
void Unire(int x, int y)
{
    if (RG[x] > RG[y])
        TT[x] = y;
    if (RG[x] < RG[y])
        TT[y] = x;
    if (RG[x] == RG[y])
    {
        TT[x] = y;
        RG[y]++;
    }
}
void Rezolva()
{
    for (i = 1; i <= M; i++)
    {
        if (VerificareTata(V[i].x) != VerificareTata(V[i].y))
        {
            Unire(VerificareTata(V[i].x), VerificareTata(V[i].y));
            P[++k].first = V[i].x;
            P[k].second = V[i].y;
            Total += V[i].cost;
        }
    }
}
int main()
{
    Citire();
    Rezolva();
    Afisare();
}