#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
#define nmax 200005
#define mmax 400005
struct muchie
{
    int x, y, c;
};
bool cmpf(muchie a, muchie b)
{
    return a.c<b.c;
}
int n, m, cost=0, index[mmax], t[nmax], rang[nmax];
muchie l[mmax];
void citire()
{
    int i;
    fin>>n>>m;
    for(i=1; i<=m; i++)
        fin>>l[i].x>>l[i].y>>l[i].c;
    fin.close();
}
void preprocesare()
{
    int i;
    for(i=1; i<=n; i++)
        rang[i]=t[i]=i;
}
int radacina(int nod)
{
    int r, aux;
    r=nod;
    while(t[r]!=r)
        r=t[r];
    while(t[nod]!=nod)
    {
        aux=t[nod];
        t[nod]=r;
        nod=aux;
    }
    return r;
}
void uneste(int x, int y)
{
    if(rang[x]<rang[y])
        t[x]=y;
    else t[y]=x;
}
void kruskal()
{
    int k, i, x, y;
    preprocesare();
    sort(l+1, l+1+m, cmpf);
    k=0; i=1;
    while(k<n-1 && i<=m)
    {
        x=l[i].x;
        y=l[i].y;
        if(radacina(x)!=radacina(y))
        {
            uneste(radacina(x), radacina(y));
            cost+=l[i].c;
            k++;
            index[k]=i;
        }
        i++;
    }
}
void afisare()
{
    int i;
    fout<<cost<<'\n'<<n-1<<'\n';
    for(i=1; i<=n-1; i++)
        fout<<l[index[i]].x<<' '<<l[index[i]].y<<'\n';
    fout.close();
}
int main()
{
    citire();
    kruskal();
    afisare();
    return 0;
}