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

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

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

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

struct elem {
    int x,y,cost;
    elem (int _x = 0,int _y = 0,int _cost = 0) {
        x = _x;
        y = _y;
        cost = _cost;
    }
};
bool operator <(elem a, elem b) {
    return a.cost > b.cost;
}

vector<elem> v[NMax],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 costArb = 0;
    priority_queue<elem> Q;
    Q.push(elem(0,1,0));
    while (Q.size()) {
        elem e = Q.top();
        Q.pop();
        if (inApm[e.y]) {
            continue;
        }

        int node = e.y;
        inApm[node] = true;
        costArb += e.cost;
        sol.pb(elem(e.x,e.y));

        for (auto nextElem : v[node]) {
            int nxt = nextElem.y, cost = nextElem.cost;
            if (inApm[nxt] || cost >= lung[nxt]) {
                continue;
            }

            lung[nxt] = cost;
            Q.push(elem(node,nxt,cost));
        }
    }

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

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