#include <bits/stdc++.h>

using namespace std;

ifstream in("apm.in");
ofstream out("apm.out");
const int MMax = 400005;

pair<int, int>P[MMax];
int k;

int N, M, Total, TT[MMax], RG[MMax];

struct Muchie
{
    int x, y, cost;
}V[MMax];

bool compare(Muchie a, Muchie b)
{
    return a.cost < b.cost;
}

void read()
{
    in>>N>>M;
    for(int i = 1; i <= M; i++)
        in>>V[i].x>>V[i].y>>V[i].cost;
    sort(V+1, V+M+1, compare);

    for(int i = 1; i <= N;i++)
    {
        TT[i]=i;
        RG[i]=1;
    }

}

int Find(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;
    else if(RG[x] > RG[y])
        TT[y] = x;
    else
    {
        TT[x] = y;
        RG[y]++;
    }
}

void Rezolva()
{
    for(int i = 1; i <= M; i++)
    {
        if(Find(V[i].x) != Find(V[i].y))
        {
            Unire(Find(V[i].x), Find(V[i].y));
            P[++k].first = V[i].y;
            P[k].second = V[i].x;
            Total+=V[i].cost;
        }
    }
}

void Afisare()
{
    out<<Total<<"\n";
    out<<N-1<<"\n";

    for(int i = 1; i <= k; i++)
        out<<P[i].first<<" "<<P[i].second<<"\n";
}

int main()
{
    read();
    Rezolva();
    Afisare();
    return 0;
}