#include <fstream>
#include <vector>
#include <queue>
#define DIM 200001
#define INF 1001
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
int n,m,x,y,cost,s,c[DIM],t[DIM];
bool viz[DIM];
vector<pair<int,int>> l[DIM];
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
int main() {
    fin>>n>>m;
    for (int i=1;i<=m;i++) {
        fin>>x>>y>>cost;
        l[x].push_back({y,cost});
        l[y].push_back({x,cost});
    }
    for (int i=1;i<=n;i++)
        c[i]=INF;
    c[1]=0;
    t[1]=0;
    pq.push({0,1});
    while (!pq.empty()) {
        int nod=pq.top().second;
        pq.pop();
        if (viz[nod]==1)
            continue;
        viz[nod]=1;
        s+=c[nod];
        for (int i=0;i<l[nod].size();i++) {
            int vec=l[nod][i].first;
            int cost=l[nod][i].second;
            if (viz[vec]==0 && cost<c[vec]) {
                c[vec]=cost;
                t[vec]=nod;
                pq.push({cost,vec});
            }
        }
    }
    fout<<s<<"\n"<<n-1<<"\n";
    for (int i=2;i<=n;i++)
        fout<<i<<" "<<t[i]<<"\n";
    return 0;
}