#include <iostream>
#include <fstream>
#include <queue>
#include <bitset>

using namespace std;

ifstream in("apm.in");
ofstream out("apm.out");

vector <pair <int, int>> v[200001];

priority_queue <pair <int, int>> pq;

bitset <200001> a;

int d[200001], pred[200001];

int n, m, cost;

void prim_apm()
{
    for(int i=2;i<=n;i++)
        d[i]=1000000000;
    pq.push({0,1});
    while(!pq.empty()){
        int x=pq.top().second;
        pq.pop();
        if(a[x])
            continue;
        cost+=d[x];
        a[x]=true;
        for(auto p:v[x]){
            int y=p.first;
            int c=p.second;
            if(!a[y] && c<d[y]){
                d[y]=c;
                pred[y]=x;
                pq.push({-c,y});
            }
        }
    }
}

int main()
{
    in>>n>>m;
    for(int i=0;i<m;i++){
        int x,y,c;
        in>>x>>y>>c;
        v[x].push_back({y,c});
        v[y].push_back({x,c});
    }
    prim_apm();
    out<<cost<<'\n'<<n-1<<'\n';
    for(int i=2;i<=n;i++)
        out<<i<<' '<<pred[i]<<'\n';
    return 0;
}