#include<fstream>
#include<algorithm>
using namespace std;
#define MMAX 400005
#define NMAX 200005
ifstream f("apm.in");
ofstream g("apm.out");
struct muchie
{
    int x,y,c;
} a[MMAX];
int n,m,tata[NMAX],ind[NMAX];

void cit()
{
    f>>n>>m;
    for(int i=1; i<=m; i++)
    {

        f>>a[i].x>>a[i].y>>a[i].c;
    }
}
int rad(int x)
{
    while(tata[x]!=x)x=tata[x];
    return x;
}

void Quicksort (int s, int d)
{
    int i=s, j=d, pivot=a[(i+j)/2].c;
    muchie aux;
    while(i<=j)
    {
        while(a[i].c<pivot)
            i++;
        while(a[j].c>pivot)
            j--;
        if(i<=j)
        {
            aux=a[i];
            a[i]=a[i+1];
            a[i+1]=aux;
            i++, j--;
        }
    }
    if(s<j)
        Quicksort(s,j);
    if(i<d)
        Quicksort(i,d);
}

int main()
{
    cit();
    Quicksort(1,n);
    for(int i=1; i<=n; i++)tata[i]=i;
    int k=0,i=1,ct=0;
    while(k<n-1)
    {
        int r1=rad(a[i].x),r2=rad(a[i].y);
        if(r1!=r2)
        {
            k++,ct+=a[i].c,ind[k]=i;
            if(r1<r2)tata[r2]=r1;
            else tata[r1]=r2;
        }
        i++;
    }
    g<<ct<<'\n'<<k<<'\n';
    for(i=1; i<=k; ++i)
        g<<a[ind[i]].x<<' '<<a[ind[i]].y<<'\n';
    return 0;
}