#include <bits/stdc++.h>

using namespace std;

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

int n,m,costarbore,d[200001];
bool viz[400001];

struct muchie{int nod1;int nod2;int cost;}v[400001];

bool sortcomp(muchie a, muchie b)
{
    return a.cost<b.cost;
}

void citire()
{
    f>>n>>m;
    for(int i=0;i<m;++i)
    {
        int x,y,c;
        f>>x>>y>>c;
        v[i].nod1=x;
        v[i].nod2=y;
        v[i].cost=c;
    }
}
void kruskal()
{
    for(int i=1;i<=n;++i)
    d[i]=i;
    int pas=0,i=1;
    for(int i=0;i<m&&pas<n-1;++i)
    {
        if(d[v[i].nod1]!=d[v[i].nod2])
        {
            ++pas;
            costarbore+=v[i].cost;
            int aux=d[v[i].nod2];
            viz[i]=1;
            for(int j=1;j<=n;++j)
                if(d[j]==aux)
                d[j]=d[v[i].nod1];

        }
    }
}

int main()
{
    citire();
    sort(v,v+m,sortcomp);
    kruskal();
    g<<costarbore<<'\n'<<n-1<<'\n';
    for(int i=0;i<m;++i)
        if(viz[i]==1)
            g<<v[i].nod1<<' '<<v[i].nod2<<'\n';
}