#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");

int N,M;
int TT[200005],R[200005],Cost;
vector <int> Sol;
struct Muchie{

int x,y,c;

};

Muchie V[400005];

void Read()
{
    fin>>N>>M;
    for(int i=1;i<=N;++i)
        fin>>V[i].x>>V[i].y>>V[i].c;
}

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

int Father(int Node)
{
    while(Node!=TT[Node])
    {
        Node=TT[Node];
    }
    return Node;
}

void Unite(int A,int B)
{
    if(R[B]>R[A])
        TT[A]=B;
    else TT[B]=A;
    if(R[A]==R[B])
        R[A]++;
}

void Solve()
{
    sort(V+1,V+1+M,Compare);
    for(int i=1;i<=N;++i)
        TT[i]=i;
    for(int i=1;i<=M;++i)
    {
        int X=Father(V[i].x);
        int Y=Father(V[i].y);
        if(X!=Y)
        {
            Unite(X,Y);
            Cost+=V[i].c;
            Sol.push_back(i);
        }
    }

}

void Print()
{
    fout<<Cost<<"\n"<<N-1<<"\n";

    for(int i=0;i<(int)Sol.size();++i)
        fout<<V[Sol[i]].x<<" "<<V[Sol[i]].y<<"\n";
}

int main()
{
    Read();
    Solve();
    Print();
    return 0;
}