#include <fstream>
#include <algorithm>
#define maxM 400005
using namespace std;
ifstream cin("apm.in");
ofstream cout("apm.out");
int n,m;
int tata[maxM], rang[maxM];
struct muchie{
    int x,y,cost;
};
muchie v[maxM];
pair <int,int> muchii[maxM];
int k=0,total=0;
int comparare(muchie a, muchie b)
{
    return a.cost<b.cost;
}
void citire()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        cin>>v[i].x>>v[i].y>>v[i].cost;
        tata[i]=i;
        rang[i]=1;
    }
    sort(v+1,v+m+1,comparare);
}
int verif_tata(int nod)
{
    while(tata[nod]!=nod)
        nod=tata[nod];
    return nod; 
}
void unire(int x, int y)
{
    if(rang[x]<rang[y]) tata[x]=y;
    else if(rang[x]>rang[y]) tata[y]=x;
    else{
        tata[x]=y;
        rang[y]++;
    }
}
void kruskal()
{
    for(int i=1;i<=m;i++)
    {
        int tatal_x=verif_tata(v[i].x);
        int tatal_y=verif_tata(v[i].y);
        if(tatal_x!=tatal_y){
            unire(tatal_x,tatal_y);
            muchii[++k].first=v[i].x;
            muchii[k].second=v[i].y;
            total+=v[i].cost;
        }
    }
}
void afisare()
{
    cout<<total<<endl;
    cout<<n-1<<endl;
    for(int i=1;i<=k;i++)
    cout<<muchii[i].first<<" "<<muchii[i].second<<endl;
}
int main()
{
    citire();
    kruskal();
    afisare();
    return 0;

}