#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

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

const int NLIM = 400005;

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

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

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

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

void Citire()
{
    fin >> N >> M;

    for(int i = 1; i <= M; i++)
    {
        fin>>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;
    }
    //for(int i = 1; i <= M; i++) cout<<V[i].x <<" "<< V[i].y<<" "<<V[i].cost<<endl;
}

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 Rezolva()
{
    for(int i = 1; i <= M; i++)
    {
        int tatal_x = Find(V[i].x), tatal_y = Find(V[i].y);
        if(tatal_x != tatal_y)
        {
            Unire(tatal_x, tatal_y);
            P[++k].first = V[i].x;
            P[k].second = V[i].y;
            Total += V[i].cost;
        }
    }
}

void Tipar()
{
    fout<< Total<<endl<<N-1<<endl;
    for(int i = 1; i <= N-1; i++)
    {
        fout<<P[i].second<<" "<<P[i].first<<endl;
    }
}

int main()
{
    Citire();
    Rezolva();
    Tipar();

    return 0;
}