#include <fstream>
#include <algorithm>
#include <vector>
#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];
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;

    for(int i=1;i<=n;i++){  /// avem n pasi
        ///determinam nodul care are costul minim si e nevizitat
        int Min=inf,p=0;
        for(int j=1;j<=n;j++){
            if(cost[j]<Min&&viz[j]==0){
                Min=cost[j];
                p=j;
            }
        }
        viz[p]=1;
        sol+=cost[p];
        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){
                cost[vc]=ct;
                tata[vc]=p;
            }
        }
    }
    fout<<sol<<"\n"<<n-1<<"\n";
    for(int i=2;i<=n;i++)
        fout<<i<<" "<<tata[i]<<"\n";
    return 0;
}