#include<cstdio>
#include<vector>
#include<algorithm>
#define MAX_N 200000
#define MAX_M 400000
using namespace std;

struct edge {
    int x, y;
    short cost;
};

edge v[MAX_M];
vector<pair<int,int>>apm;
int p[MAX_N + 1], h[MAX_N + 1], n, m, k, minCost;

inline bool cmp(edge a, edge b) {
    return a.cost < b.cost;
}

void readGraph() {
    FILE *fin = fopen("apm.in","r");
    fscanf(fin,"%d%d",&n,&m);
    for(int i = 0; i < m; i++)
        fscanf(fin,"%d%d%hd",&v[i].x,&v[i].y,&v[i].cost);
    fclose(fin);
}

void Init(int n) {
    for(int i = 1; i <= n; i++) {
        p[i] = i;
        h[i] = 1;
    }
}

inline int Find(int x) {
    int aux, tmp;
    aux = x;
    while(p[aux] != aux)
        aux = p[aux];
    while(p[x] != aux) {
        tmp = p[x];
        p[x] = aux;
        x = tmp;
    }
    return aux;
}

inline void Union(int x, int y, int i) {
    int rootx, rooty;
    rootx = Find(x);
    rooty = Find(y);
    if(rootx != rooty) {
        minCost += v[i].cost;
        apm.push_back(make_pair(x,y));
        k++;
        if(h[rootx] < h[rooty])
            p[rootx] = rooty;
        else if(h[rootx] > h[rooty])
            p[rooty] = rootx;
        else {
            p[rootx] = rooty;
            h[rooty]++;
        }
    }
}

void Kruskal() {
    Init(n);
    sort(v,v+m,cmp);
    for(int i = 0; k < n - 1; i++)
        Union(v[i].x,v[i].y,i);
}

void printAPM() {
    FILE *fout = fopen("apm.out","w");
    fprintf(fout,"%d\n%d\n",minCost,k);
    for(int i = 0; i < k; i++)
        fprintf(fout,"%d %d\n",apm[i].first,apm[i].second);
    fclose(fout);
}

int main() {
    readGraph();
    Kruskal();
    printAPM();
    return 0;
}