#include <fstream>
#include <algorithm>

using namespace std;
ifstream f("amp.in");
ofstream g("amp.out");
int t[1000001],i,m,n,cnt=0,cost=0;
struct poz
{
    int x,y,c;
};
poz v[1000001];
bool rez[1000001];
int radacina( int x)
{
    if(t[x]==0)
        return x;
    t[x]=radacina(t[x]);
    return t[x];
}
void reuniune (int x, int y)
{
    int rx;
    int ry;
    rx=radacina(x);
    ry=radacina(y);
    t[ry]=rx;
}
bool impreuna (int x,int y)
{
    int rx;
    int ry;
    rx=radacina(x);
    ry=radacina(y);
    if(rx==ry)
        return true ;
    else return false ;
}
bool cmp (poz a, poz b)
{
    return a.c<b.c;
}
int main()
{
    f>>n>>m;
    for(i=1;i<=m; i++)
        f>>v[i].x>>v[i].y>>v[i].c;
     sort(v+1,v+m+1,cmp);
    for(i=1; i<=m; i++)
        if(!impreuna(v[i].x,v[i].y))
        {
            cost+=v[i].c;
            reuniune(v[i].x,v[i].y);
            rez[i]=true;
            cnt++;
        }
    g<<cost<<"\n"<<cnt<<"\n";
    for(i=1; i<=cnt; i++)
        if(rez[i]==true)
            g<<v[i].x<<" "<<v[i].y<<"\n";

    return 0;

}