#include <fstream>
#include <queue>
using namespace std;

ifstream fin("apm.in");
ofstream fout ("apm.out");
//////////////////////////////////
const int NMAX = 200002;
const int MMAX = 400002;
int n,m;
int tata[NMAX];
int h[NMAX]; //inaltimea fiecarui arobre

struct muchie {int x,y,c;
friend bool operator < (muchie a, muchie b);
};

priority_queue<muchie> H;
muchie apm[NMAX];

bool operator < (muchie a, muchie b)
{
    return a.c > b.c;
}

int costmin;

//////////////////////////////
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()
{ int i,x,y,c;
muchie aux;
    fin>>n>>m;
    for (int i =0; i<m; i++)
    {
        fin>>aux.x>>aux.y>>aux.c;
        H.push(aux);
    }
}
void kruskal()
{
    muchie aux;
    int nrsel = 0;

    while (nrsel <n-1)
    {
        aux = H.top();
        H.pop();
        int rx = Find(aux.x);
        int ry = Find(aux.y);
        if (rx!=ry)
        {
          costmin+=aux.c;
          apm[++nrsel] = aux;
          Union(rx,ry);
        }
    }
}
void afisare()
{
    fout<<costmin<<'\n'<<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;
    while(tata[rx] != 0) rx = tata[rx];
    //rx este radacina
    //compresez drumul de la x la rx; fiecare nod de pe acest grup devine fiu al lui rx
    int y;
    while(tata[x] != rx && tata[x])
    {
        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;
    }
    else if (h[ry] < h[rx])
    {
        tata[ry] = rx;
    }
    else //egalitate
    {
        tata[ry] = rx;
        h[rx]++;
    }
}