#include <bits/stdc++.h>
using namespace std;

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

typedef pair<int,int> pr;

int dist[200005],viz[200005],i,j,n,m,a,b,cost,nod,vecin,tata[200005],suma;
vector <pr> v[200005];
priority_queue <pr, vector<pr>, greater<pr>> pq;

int main()
{
fin>>n>>m;
for(i=1;i<=m;i++){
    fin>>a>>b>>cost;
    v[a].push_back({b,cost});
    v[b].push_back({a,cost});
}
for(i=1;i<=n;i++){
    dist[i] = 1000000000;

}
dist[1] = 0;
pq.push({0,1});
while(!pq.empty()){
    nod = pq.top().second;
    pq.pop();
    if(!viz[nod]){
    viz[nod] = 1;
    for(i=0;i<v[nod].size();i++){
        vecin = v[nod][i].first;
        cost = v[nod][i].second;
        if(dist[vecin] > cost && !viz[vecin]){
            dist[vecin] = cost;
            pq.push({dist[vecin],vecin});
            tata[vecin] = nod;
        }
    }
    }
}
for(i=1;i<=n;i++){
   suma += dist[i];
}
fout << suma << '\n';
fout << n - 1 << '\n';
for(i=2;i<=n;i++){
    fout << i << " " << tata[i] << '\n';
}
    return 0;
}