#include <bits/stdc++.h>
#define nmax 200002
#define mmax 400002

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

struct muchie{
    int x,y,c;
    friend bool operator < (muchie a, muchie b);
};
priority_queue<muchie> H;

int n,m;
int tata[nmax];
int h[nmax]; // h[x] = inaltimea arborelui cu radacina x
muchie apm[nmax];
int cmin;
int Find(int x);
int Union(int x,int y);

bool operator < (muchie a, muchie b){
    return a.c>b.c;
}

void citire();
void kruskal();
void afisare();

int main()
{
    citire();
    kruskal();
    afisare();
    return 0;
}
int Find(int x){
    int y;
    int rx;
    //determin radacina arborelui
    rx = x;
    while(tata[rx]!=0){
        rx = tata[rx];
        //rx este radacina arborelui
    }
    //compresez drumul de la x la rx;
    //fiecare nod de pe acest drum devine fiu al lui rx
    while(tata[x]&&tata[x]!=rx){
        y = tata[x];
        tata[x] = rx;
        x = y;
    }
    return rx;
}
int Union(int x,int y){
    int rx,ry;
    //reuneste arborele in care se afla x cu arborele in care se afla y
    rx = Find(x);
    ry = Find(y);
    if(h[rx]<h[ry]){
        //rx devine fiul lui ry
        tata[rx] = ry;
    }
    else if(h[ry]<h[rx]){
        //ry devine fiul lui rx
        tata[ry] = rx;
    }
    else{
        //egalitate
        tata[ry] = rx;
        h[rx]++;
    }
}
void citire(){
    int i;
    muchie aux;
    fin>>n>>m;
    for(i=0;i<m;i++){
        fin>>aux.x>>aux.y>>aux.c;
        H.push(aux);
    }
}
void kruskal(){
    int nrsel;
    muchie aux;
    int rx,ry;
    nrsel = 0;
    while(nrsel<n-1){
        aux = H.top();
        H.pop();
        rx = Find(aux.x);
        ry = Find(aux.y);
        if(rx!=ry){
            cmin += aux.c;
            apm[++nrsel] = aux;
            Union(rx,ry);
        }
    }
}
void afisare(){
    int i;
    fout<<cmin<<'\n'<<n-1<<'\n';
    for(i=1;i<n;i++){
        fout<<apm[i].x<<' '<<apm[i].y<<'\n';
    }
}