#include <fstream>
#include <algorithm>
#include <queue>
using namespace std;
ifstream cin("apm.in");
ofstream cout("apm.out");
int t[100005],i,n,m,c,x,y,k;
long long s;
struct elem
{
    int x,y,c;
}v[400005],fin[200005];
int rad(int x)
{
    int k1=x;
    while(t[x]>0)
        x=t[x];
    int k2=x;
    x=k1;
    while(x!=k2)
    {
        k1=t[x];
        t[x]=k2;
        x=k1;
    }
    return k2;
}
bool ququ(int x,int y)
{
    return rad(x)==rad(y);
}
void join(int x,int y)
{
    int k1=rad(x),k2=rad(y);
    if(k1==k2)
        return;
    if(t[k1]<=t[k2])
    {
        t[k1]+=t[k2];
        t[k2]=k1;
    }
    else
    {
        t[k2]+=t[k1];
        t[k1]=k2;
    }
}
bool cmp(elem a,elem b)
{
    return a.c<b.c;
}
int main()
{
    cin>>n>>m;
    for(i=1;i<=n;i++)
        t[i]=-1;
    for(i=1;i<=m;i++)
        cin>>v[i].x>>v[i].y>>v[i].c;
    sort(v+1,v+m+1,cmp);
    for(i=1;i<=m;i++)
    {
        int k1=rad(v[i].x),k2=rad(v[i].y);
        if(k1!=k2)
        {
            s+=v[i].c;
            fin[++k].x=v[i].x;
            fin[k].y=v[i].y;
            join(v[i].x,v[i].y);
        }
    }
    cout<<s<<"\n"<<k<<"\n";
    for(i=1;i<=k;i++)
        cout<<fin[i].y<<" "<<fin[i].x<<"\n";
    return 0;
}