#include <fstream>
#include <vector>
#include <algorithm>
#define nmax 200004
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");

int n,m,fa[nmax],sol[nmax],k,total;
struct s
{
    int x,y,c;
} v[nmax];

bool cmp (s a, s b)
{
    return a.c<b.c;
}
int find (int x)
{
    if (fa[x]==x) return x;
    return fa[x]=find(fa[x]);
}

int main()
{
    f>>n>>m;
    for (int i=1;i<=m;i++)
    {
        f>>v[i].x>>v[i].y>>v[i].c;
    }
    sort (v+1,v+m+1,cmp);
    for (int i=1;i<=n;i++) fa[i]=i;
    for (int i=1;i<=m;i++)
    {
        if(find(v[i].x)!=find(v[i].y))
        {
            fa[find(v[i].x)]=find(v[i].y);
            sol[++k]=i;
            total+=v[i].c;
        }
    }
    g<<total<<'\n'<<n-1<<'\n';
    for (int i=1;i<=n-1;i++) g<<v[sol[i]].x<<' '<<v[sol[i]].y<<'\n';
    f.close();
    g.close();
    return 0;
}