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

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

const int NMax = 2e6 + 5;
const int inf = INT_MAX;

int N,M,costArb,nrMuchii;
int lung[NMax];
bool inAPM[NMax];

struct elem {
    int x,y,c;
    elem() {}
    elem(int a,int b,int cost) {
        x = a;
        y = b;
        c = cost;
    }
};
vector<elem> v[NMax],sol;
priority_queue<elem> Q;

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

int main() {
    in>>N>>M;
    for (int i=1;i<=M;++i) {
        int x,y,c;
        in>>x>>y>>c;

        elem e1(x,y,c);
        v[x].push_back(e1);
        elem e2(y,x,c);
        v[y].push_back(e2);
    }

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

    elem st(0,1,0);
    Q.push(st);
    while (Q.size()) {
        elem e = Q.top();
        Q.pop();
        int nod = e.y;
        if (inAPM[nod] || lung[nod] < e.c) {
            continue;
        }
        inAPM[nod] = true;
        costArb += lung[nod];
        ++nrMuchii;

        sol.push_back(e);

        vector<elem>::iterator it;
        for (it = v[nod].begin();it < v[nod].end();++it) {
            int next = it->y, cost = it->c;
            if (!inAPM[next] && lung[next] > cost) {
                lung[next] = cost;

                elem n(nod,next,cost);
                Q.push(n);
            }
        }
    }

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

    return 0;
}