#include <algorithm>
using namespace std;

#define DIM 400005
#define MAX 200005

struct muchie {int x,y,c;} a[DIM],s[MAX];
int p[MAX],r[MAX];
int n,m,nrm,ct;

void read ()
{
    int i;

    scanf ("%d%d",&n,&m);
    for (i=1; i<=m; ++i)
        scanf ("%d%d%d",&a[i].x,&a[i].y,&a[i].c);
    for (i=1; i<=n; ++i)
        p[i]=i;
}

int cmp (muchie a,muchie b)
{
    return a.c<b.c;
}

void unite (int x,int y)
{
    if (r[x]<r[y])
        p[x]=y;
    else
        p[y]=x;
    if (r[x]==r[y])
        ++r[x];
}

int find (int x)
{
    if (x!=p[x])
        p[x]=find (p[x]);
    return p[x];
}

void solve ()
{
    int i;

    for (i=1; nrm<n-1; ++i)
        if (find (a[i].x)!=find (a[i].y))
        {
            ct+=a[i].c;
            s[++nrm]=a[i];
            unite (find (a[i].x),find (a[i].y));
        }
}

void print ()
{
    int i;

    printf ("%d\n%d\n",ct,nrm);
    for (i=1; i<=nrm; ++i)
        printf ("%d %d\n",s[i].x,s[i].y);
}

int main ()
{
    freopen ("apm.in","r",stdin);
    freopen ("apm.out","w",stdout);

    read ();
    sort (a+1,a+m+1,cmp);
    solve ();
    print ();

    return 0;
}