//#include <fstream>
#include <cstdio>
#include <algorithm>
#define MMAX 400000
#define NMAX 200001
#define IN "apm.in","r"
#define OUT "apm.out","w"

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

FILE*fin=fopen(IN);
FILE*fout=fopen(OUT);

struct Muchie
{
    int x, y;
    int cost;
};

Muchie G[MMAX];
int n, m;
int APM[NMAX], conex[NMAX];
int cost_apm;

void citire();
void quick(int,int);
//int compara(Muchie, Muchie);
void kruskal();
void afisare();

int main()
{
    citire();
    quick(1,m);
    //sort(G, G+m, compara);
    kruskal();
    afisare();
    fclose(fout);
    return 0;
}

void citire()
{
    int i;
    //fin>>n>>m;
    fscanf(fin,"%d%d",&n,&m);
    for(i=0; i<m; i++)
    {
        //fin>>G[i].x>>G[i].y>>G[i].cost;
        fscanf(fin,"%d%d%d",&G[i].x,&G[i].y,&G[i].cost);
    }
    for(i=1; i<=n; i++)
        conex[i]=i;
}

/*int compara(Muchie a, Muchie b)
{
    return a.cost<b.cost;
}*/

void kruskal()
{
    int nrm=0, j, i, minim, maxim;
    for (i=0; nrm<n-1; i++)
    {
        if (conex[G[i].x]!=conex[G[i].y])
        {
            APM[++nrm]=i;
            cost_apm+=G[i].cost;
            if (conex[G[i].x]>conex[G[i].y])
            {
                minim=conex[G[i].y];
                maxim=conex[G[i].x];
            }
            else
            {
                minim=conex[G[i].x];
                maxim=conex[G[i].y];
            }
            for (j=1; j<=n; j++)
                if (conex[j]==maxim)
                    conex[j]=minim;
        }
    }
}

void quick(int st, int dr)
{
      int i=st, j=dr, pivot=G[(st+dr)/2].cost;
    Muchie aux;
      /* partition */
      while (i<=j)
      {
            while (G[i].cost<pivot)  i++;
            while (G[j].cost>pivot)  j--;
            if (i<=j)
            {
                  aux=G[i];
                  G[i]=G[j];
                  G[j]=aux;
                  i++;
                  j--;
            }
      }

      /* recursion */
      if (st<j)
        quick(st,j);
      if (i<dr)
        quick(i,dr);
}

void afisare()
{
    int i;
    //fout<<cost_apm<<'\n'<<n-1<<'\n';
    fprintf(fout,"%d\n%d\n",cost_apm,n-1);
    for (i=1; i<=n-1; i++)
        //fout<<G[APM[i]].x<<' '<<G[APM[i]].y<<'\n';
        fprintf(fout,"%d %d\n",G[APM[i]].x,G[APM[i]].y);
}