#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
const int Max=400005;

int k;
int N,M,Total,TT[Max],Rg[Max];


pair<int,int>P[Max];
struct Muchie
{
    int x,y,cost;
}V[Max];

int Comper(Muchie a,Muchie b)
{
    return a.cost<b.cost;
}
void Read()
{
    fin>>N>>M;
    for(int i=1;i<=M;i++)
    {
        fin>>V[i].x>>V[i].y>>V[i].cost;
    }
    sort(V+1,V+1+M,Comper);
    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;
}

int 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 Rezolvare()
{
    for(int i=1;i<=M;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()
{
    fout<<Total<<"\n";
    fout<<N-1<<"\n";

    for(int i=1;i<=k;i++)
    {
        fout<<P[i].second<<" "<<P[i].first<<"\n";
    }
}
int main()
{
    Read();
    Rezolvare();
    afisare();
}