#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

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

#define pb push_back
const int NMax = 2e5 + 5;
const int inf = 1e9 + 5;

int N,M;
bool inApm[NMax];
int lung[NMax];

struct elem {
    int x,y,c;
    elem (int _x = 0,int _y = 0,int _c = 0) {
        x = _x;
        y = _y;
        c = _c;
    }
};
bool operator <(elem a,elem b) {
    return a.c > b.c;
}
vector<elem> v[NMax];
vector<elem> sol;

int main() {
    in>>N>>M;
    for (int i=1;i<=M;++i) {
        int x,y,c;
        in>>x>>y>>c;
        v[x].pb(elem(x,y,c));
        v[y].pb(elem(y,x,c));
    }

    for (int i=2;i<=N;++i) {
        lung[i] = inf;
    }
    lung[1] = 0;

    int nrMuchii = 0, costApm = 0;
    priority_queue<elem> Q;
    Q.push(elem(0,1,0));
    while (Q.size()) {
        elem top = Q.top();
        Q.pop();

        int nod = top.y;
        if (inApm[nod]) {
            continue;
        }
        inApm[nod] = true;
        ++nrMuchii;
        costApm += top.c;
        sol.pb(top);

        for (int k=0;k < (int)v[nod].size();++k) {
            int next = v[nod][k].y, cost = v[nod][k].c;
            if (inApm[next] || lung[next] < cost) {
                continue;
            }
            lung[next] = cost;
            Q.push(elem(nod,next,lung[next]));
        }
    }

    out<<costApm<<'\n'<<nrMuchii-1<<'\n';
    for (int k=1;k < (int)sol.size();++k) {
        out<<sol[k].x<<' '<<sol[k].y<<'\n';
    }

    in.close();out.close();
    return 0;
}