#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("apm.in");
ofstream out("apm.out");
int n,m,t[200010],r,rm[400010],nr;
struct muchie{int x,y,c;}v[400010];
bool comp(muchie a,muchie b)
{
    return a.c<b.c;
}
int unire(int i)
{
    if(t[i]==i)
        return i;
    t[i]=unire(t[i]);
    return t[i];
}
int main()
{
    in>>n>>m;
    for(int i=1;i<=n;++i)
        t[i]=i;
    for(int i=1;i<=m;++i)
        in>>v[i].x>>v[i].y>>v[i].c;
    sort(v+1,v+m+1,comp);
    for(int i=1;i<=m;++i)
    {
        if(unire(v[i].x)!=unire(v[i].y))
        {
            r+=v[i].c;
            t[t[v[i].x]]=v[i].y;
            rm[++nr]=i;
        }
    }
    out<<r<<'\n'<<nr<<'\n';
    for(int i=1;i<=nr;++i)
        out<<v[rm[i]].x<<' '<<v[rm[i]].y<<'\n';
    return 0;
}