#include <cstdio>
#include <queue>
#include <vector>
#include <bitset>
using namespace std;

const int nmx = 200002;

int n,m,sum;
vector <pair<int,int> > g[nmx],r;

void citire(){
    scanf("%d %d", &n, &m);
    int nod1,nod2,cost;
    for(int i = 1; i <= m; ++i){
        scanf("%d %d %d", &nod1, &nod2, &cost);
        g[nod1].push_back(make_pair(nod2,cost));
        g[nod2].push_back(make_pair(nod1,cost));
    }
}

void apm(){
    priority_queue <pair<int,pair<int,int> > > q;
    bitset <nmx> viz;
    viz[1] = true;
    for(vector<pair<int,int> >::iterator it = g[1].begin(); it != g[1].end(); ++it)
        q.push(make_pair(-(it->second),make_pair(1,it->first)));
    int nod;
    for(int i = 2; i <= n; ++i){
        while(viz[q.top().second.second])
            q.pop();
        sum -= q.top().first;
        r.push_back(make_pair(q.top().second.first,q.top().second.second));
        nod = q.top().second.second;
        viz[nod] = true;
        for(vector<pair<int,int> >::iterator it = g[nod].begin(); it != g[nod].end(); ++it)
            if(not viz[it->first])
                q.push(make_pair(-(it->second),make_pair(nod,it->first)));
    }
}

void afish(){
    printf("%d\n", sum);
    printf("%d\n", n-1);
    for(vector<pair<int,int> >::iterator it = r.begin(); it != r.end(); ++it)
        printf("%d %d\n", it->first, it->second);
}

int main() {
    freopen("apm.in", "r", stdin);
    freopen("apm.out", "w", stdout);
    citire();
    apm();
    afish();
    return 0;
}