#include <fstream>
#include <queue>
#define NMAX 200002
#define MMAX 400002

using namespace std;
ifstream fin ("apm.in");
ofstream fout("apm.out");

int n, m;
struct muchie
    {
        int x, y, c;
        friend bool operator < (muchie a, muchie b);
    };
priority_queue <muchie> H;
int tata[NMAX]; //tatal fiecarui varf
int h[NMAX]; //inaltimea fiecarui arbore
muchie apm[NMAX];
int costmin;

bool operator < (muchie a, muchie b)
{
    return a.c>b.c;
}
void citire();
void kruskal();
void afisare();
int Find (int x);
void Union (int x, int y);

int main()
{
    citire();
    kruskal();
    afisare();
    return 0;
}
void citire()
{
    muchie aux;
    fin>>n>>m;
    for (int i=1; i<=m; i++)
    {
        fin>>aux.x>>aux.y>>aux.c;
        H.push(aux);
    }

}
void kruskal()
{
    muchie aux;
    int rx, ry;
    int nrsel=0;
    while (nrsel<n-1)
    {
        aux=H.top();
        H.pop();
        rx=Find(aux.x); ry=Find(aux.y);
        if (rx!=ry)
        {
            costmin+=aux.c;
            apm[++nrsel]=aux;
            Union (rx, ry);
        }
    }
}
void afisare()
{
    fout<<costmin<<'\n';
    fout<<n-1<<'\n';
    for (int i=1; i<n; i++)
        fout<<apm[i].x<<' '<<apm[i].y<<'\n';
}
int Find (int x)
{
    //determin radacina arborelui
    int rx=x, y;
    while (tata[rx]) rx=tata[rx];
    //rx este radacina
    //compresez drumul de la x la rx; fiecare nod devine
    //fiu al lui rx
    while (tata[x] && tata[x]!=rx)
    {
        y=tata[x];
        tata[x]=rx;
        x=y;
    }
    return rx;
}
void Union (int x, int y)
//reuneste arborele in care se afla x cu arborele in care se afla y
{
    int rx, ry;
    rx=Find(x); ry=Find(y);
    if (h[rx]<h[ry]) //rx devine fiul lui ry
        tata[rx]=ry;
    if (h[ry]<h[rx]) //ry devine fiul lui rx
        tata[ry]=rx;
    else //h[rx]=h[ry]
    {
        tata[ry]=rx;
        h[rx]++;
    }
}