#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
struct muchie{
 int x,y,c;
}u[200005],sol[200005];
int n,m,i,k,ct,P[200005],j,nr1,nr2;
bool cmp(muchie x,muchie y)
{
    return x.c<y.c;
}
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>u[i].x>>u[i].y>>u[i].c;
        P[i]=i;

    }
    sort(u+1,u+m+1,cmp);
    i=1;
    while(k<n-1)
    {
        if(P[u[i].x]!=P[u[i].y])
        {
            ++k;
            ct+=u[i].c;
            sol[k]=u[i];
            nr1=P[u[i].x];
            nr2=P[u[i].y];
            for(j=1;j<=n;j++)
            if(P[j]==nr2)
                P[j]=nr1;
        }
        ++i;
    }
    g<<ct<<'\n'<<k<<'\n';
    for(i=1;i<=k;i++)
    {
        g<<sol[i].y<<" "<<sol[i].x<<'\n';
    }
}