#include <fstream>
#include <queue>
#define NMAX 200002

using namespace std;

ifstream in("apm.in");
ofstream out("apm.out");

struct muchie{
    int x, y;
    int cost;
    friend bool operator >(muchie, muchie);
};

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

priority_queue<muchie, vector<muchie>, greater<muchie> > H;

int n, costmin;
int tata[NMAX];
int h[NMAX];
muchie sel[NMAX];

int Find(int x);
void Union(int x, int y);
void citire();
void kruskal();
void afisare();

int main()
{
    citire(); //minHeap creat
    kruskal();
    afisare();
    return 0;
}

void citire(){
    muchie a;
    int m;
    in>>n>>m;
    for(int i=0;i<m;i++){
        in>>a.x>>a.y>>a.cost;
        H.push(a);
    }
}

int Find(int x){
    int rad=x, u;
    while(tata[rad]) rad=tata[rad];
    //compresez
    while(tata[x]){
        u=tata[x];
        tata[x]=rad;
        x=u;
    }
    return rad;
}

void Union(int x, int y){
    int rx, ry;
    rx=Find(x);
    ry=Find(y);
    if(h[rx]>h[ry])
        tata[ry]=rx;
    else{
       tata[rx]=ry;
       if(h[rx]==h[ry]) h[ry]++;
    }
}

void kruskal(){
    muchie a;
    int nrsel=0, c1, c2;
    while(nrsel<n-1){
        a=H.top();
        H.pop();
        c1=Find(a.x);
        c2=Find(a.y);
        if(c1!=c2){
            sel[nrsel++]=a;
            costmin+=a.cost;
            Union(c1, c2);
        }
    }
}

void afisare(){
    out<<costmin<<'\n'<<n-1<<'\n';
    for(int i=0;i<n-1;i++)
        out<<sel[i].x<<' '<<sel[i].y<<'\n';
}