#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
struct muchii
{
    int x,y;
    int p;
};
vector <pair <int, int> > sol;
int n,m,i,j,ans,color[200005],x,y,c;
muchii v[200005];
bool comp(muchii a, muchii b)
{
    return a.p<b.p;
}
int get_color(int node)
{
    if(color[node]!=node)
    {
        color[node]=get_color(color[node]);
    }
    return color[node];
}
void unite(int x, int y)
{
    color[get_color(x)]=get_color(y);
}
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>v[i].x>>v[i].y>>v[i].p;
        color[i]=i;
    }
    sort(v+1,v+m+1,comp);
    for(i=1;i<=m;i++)
    {
        if(get_color(v[i].x)!=get_color(v[i].y))
        {
            unite(v[i].x,v[i].y);
            ans+=v[i].p;
            sol.push_back({v[i].x,v[i].y});
        }
    }
    g<<ans<<"\n" <<n-1<<"\n";
    for(auto & it : sol)
    {
        g<<it.first<<" "<<it.second<<"\n";
    }
    return 0;
}