#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
const int MMax = 400005;
pair <int, int> P[MMax];
int N,M,Total, TT[MMax],RG[MMax];
struct Muchie{
    int x,y,cost;
}V[MMax];
int k;
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+M+1,compare);

    for(int i=1;i<=M;i++)
    {
        cout<<V[i].x<<" ";
        cout<<V[i].y<<" ";
        cout<<"costul: "<<V[i].cost<<endl;
    }
    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 rezolva()
{
    for(int i=1;i<=N;i++)
    {
        int tatal_x = Find(V[i].x);
        int 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 afisare()
{
    g<<Total << "\n";
    g<<N-1<<"\n";
    for(int i=1;i<=k;i++)
    g<<P[i].first<<" "<<P[i].second<<"\n";
}
int main()
{
    read();
    rezolva();
    afisare();
    return 0;
}