#include <fstream>
#include<vector>
#include<algorithm>

using namespace std;

ifstream f("apm.in");
ofstream g("apm.out");

int r[200003],p[200003],n,m,cost;
struct muchie{int x;int y;int c; bool friend operator <(muchie m1, muchie m2){return((m1.c<m2.c)||(m1.c==m2.c && m1.x<m2.x)||(m1.c==m2.c && m1.x==m2.x && m1.y<m2.y));}};

vector<muchie>h;
vector<pair<int, int> >APM;

int Find(int x)
{
    if(p[x]!=x) p[x]=Find(p[x]);
    return p[x];
}

void Union(int x, int y)
{
    int xroot,yroot;
    xroot=Find(x); yroot=Find(y);
    if(r[xroot]<r[yroot])
    {
        r[yroot]+=r[xroot];
        p[xroot]=yroot;
    }
    else {
        r[xroot]+=r[yroot];
        p[yroot]=xroot;
    }
}

void make_set()
{
    int i;
    for(i=1;i<=n;i++)
    {
        r[i]=1;
        p[i]=i;
    }
}

int main()
{
    int x,y,c,i;
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>c;
        muchie aux;
        aux.x=x; aux.y=y; aux.c=c;
        h.push_back(aux);
    }
    make_set();
    sort(h.begin(),h.end());
    vector<muchie>::iterator it;
    for(it=h.begin();it!=h.end();++it)
    {
        x=it->x; y=it->y; c=it->c;
        if(Find(x)!=Find(y))
        {
            Union(x,y);
            cost+=c;
            APM.push_back(make_pair(x,y));
        }
    }
    g<<cost<<'\n'<<APM.size()<<'\n';
    vector<pair<int, int> >::iterator it1;
    for(it1=APM.begin();it1!=APM.end();++it1)
        g<<it1->first<<' '<<it1->second<<'\n';
    f.close();
    g.close();
    return 0;
}