#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
struct str{
int x,y,cost;
} v[400005];
vector <pair<int,int> > sol;
int n,m,i,rx,ry,total,t[200005];
int cmp(str a,str b){
    return a.cost<b.cost;
}
int rad(int x){
    while(t[x]>0)
        x=t[x];
    return x;
}
int main(){
    fin>>n>>m;
    for(i=1;i<=m;i++)
        fin>>v[i].x>>v[i].y>>v[i].cost;
    for(i=1;i<=n;i++)
        t[i]=-1;
    sort(v+1,v+m+1,cmp);
    for(i=1;i<=m && sol.size()<n;i++){
        rx=rad(v[i].x);
        ry=rad(v[i].y);
        if(rx==ry)
            continue;
        if(t[rx]<t[ry]){ ///mai putine componente in graful de radacina y
            t[rx]+=t[ry];
            t[ry]=rx;
        }
        else{
            t[ry]+=t[rx];
            t[rx]=ry;
        }
        total+=v[i].cost;
        sol.push_back({v[i].x,v[i].y});
    }
    fout<<total<<"\n"<<n-1<<"\n";
    for(i=0;i<sol.size();i++)
        fout<<sol[i].first<<" "<<sol[i].second<<"\n";
    return 0;
}