#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

ifstream f("apm.in");
ofstream g("apm.out");

const int NMAX = 200005;
const int MMAX = 400005;

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

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

struct Muchie{
    int x,y,Cost;
}V[MMAX];

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

void Read(){
    f >> N >> M;

    for(int i = 1; i <= M;i++)
        f >> V[i].x >> V[i].y >> V[i].Cost;

    sort(V+1, V+ N + 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;
    if(RG[x] > RG[y])
        TT[y] = x;
    if(RG[x] == RG[y]){
        TT[x] = y;
        RG[y]++;
    }
}

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

void Afis(){
    g << Total << "\n" << k << "\n";
    for(int i = 1; i <= k;i++)
        g << P[i].first << " " << P[i].second << "\n";
}

int main()
{
    Read();
    Solve();
    Afis();

    return 0;
}