#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

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

#define MAXN 200005

struct muchie {
    int x, y, cost;
};

vector<muchie> graf, rasp;
int gr[MAXN];
int n, m, costFinal;

bool cmp(muchie A, muchie B) {
    return A.cost < B.cost;
}

int grupa(int nr) {
    if(gr[nr] == nr)
        return nr;
    
    gr[nr] = grupa(gr[nr]);
    return gr[nr];
}

void reuniune(int a, int b) {
    gr [ grupa(a) ] = grupa(b);
}

int main() {
    int i;
    muchie crt;
    
    cin >> n >> m;
    for(i=1; i<=m; i++) {
        cin >> crt.x >> crt.y >> crt.cost;
        graf.push_back(crt);
    }
    
    for(i=1; i<=n; i++)
        gr[i] = i;
    
    sort(graf.begin(), graf.end(), cmp);
    
    for(i=0; i < m; i++) {
        if( grupa( graf[i].x )  != grupa( graf[i].y )) {
            reuniune(graf[i].x, graf[i].y);
            costFinal += graf[i].cost;
            rasp.push_back(graf[i]);
        }
    }
    
    cout<<costFinal<<"\n"<<n-1<<"\n";
    for(i=0; i < rasp.size(); i++)
        cout<<rasp[i].x<<" "<<rasp[i].y<<"\n";
    
    return 0;
}