#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
#define inf 10000
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
int n,m,c,x,y,tata[200001],cnt,sol,cost[200001],viz[200001];
struct muchie{
    int x,cost;
};
vector<muchie>g[200001];
struct cmp{
bool operator()(muchie a, muchie b){
    return a.cost>b.cost;
}
};
priority_queue<muchie,vector<muchie>,cmp>heap;
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++){
        fin>>x>>y>>c;
        g[x].push_back({y,c});
        g[y].push_back({x,c});
    }
    for(int i=2;i<=n;i++)
        cost[i]=inf;

    heap.push({1,0});
    while(!heap.empty()){

       int p=heap.top().x;
       int c=heap.top().cost;
       heap.pop();
       if(viz[p]==1)
           continue;

        viz[p]=1;
        sol+=c;
        for(int j=0;j<g[p].size();j++){
            int vc=g[p][j].x;
            int ct=g[p][j].cost;
            if(cost[vc]>ct&&viz[vc]==0){
                cost[vc]=ct;
                tata[vc]=p;
                heap.push({vc,ct});
            }
        }
    }
    fout<<sol<<"\n"<<n-1<<"\n";
    for(int i=2;i<=n;i++)
        fout<<i<<" "<<tata[i]<<"\n";
    return 0;
}