#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#define NMAX 200005
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
int n,m,i,color[NMAX],ans;
struct muchii
{
    int x,y,p;
};
muchii v[NMAX];
bool comp(muchii a, muchii b)
{
    return a.p<b.p;
}
int getcolor(int node)
{
    if(color[node]!=node)
    {
        color[node]=getcolor(color[node]);
    }
    return color[node];
}
void unite(int x,int y)
{
    color[getcolor(x)]=getcolor(y);
}
vector <pair<int,int>> sol;
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(getcolor(v[i].x)!=getcolor(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;
}