#include <fstream>
#include <vector>
#include <algorithm>
#define dim 200001
#define mch 400001
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");

struct muchie{
    int x, y, cost, viz;
}v[mch+1];

int tata[dim+1];

int cmp(muchie a, muchie b)
{
    if(a.cost>b.cost)
    {
        return 0;
    }
    return 1;
}

int getroot(int nod)
{
    while(tata[nod]>0)
    {
        nod=tata[nod];
    }
    return nod;
}

int main()
{
    int n, m ,i, costminim=0;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>v[i].x>>v[i].y>>v[i].cost;
    }
    sort(v+1, v+m+1, cmp);
    for(i=1;i<=n;i++)
    {
        tata[i]=-1;
    }
    int mc=0;
    i=1;
    while(mc<n-1)
    {
        int x=v[i].x;
        int y=v[i].y;
        int c=v[i].cost;
        int rx=getroot(x);
        int ry=getroot(y);
        if(rx!=ry)
        {
            if(tata[rx]<tata[ry])
            {
                tata[rx]+=tata[ry];
                tata[ry]=rx;
            }
            else
            {
                tata[ry]+=tata[rx];
                tata[rx]=ry;
            }
            mc++;
            v[i].viz=1;
            costminim+=c;
        }
        i++;
    }
    fout<<costminim<<"\n"<<mc<<"\n";
    for(i=1;i<=m;i++)
    {
        if(v[i].viz==1)
        {
            fout<<v[i].x<<" "<<v[i].y<<"\n";
        }
    }
    return 0;
}