#include <iostream>
#include <algorithm>
#include <stdio.h>
#define NMax 200005
#define MMax 400005
using namespace std;

struct muchie
{
    int y;
    int x;
    int cost;
};

int tata[NMax],rang[NMax];
muchie e[NMax];
int N,M,sol,ssol[NMax],nredges;

bool comp(muchie a,muchie b)
{
    return (a.cost<b.cost);
}

int Radacina(int x)
{
    while(tata[x]!=x)
        x=tata[x];
}

void Sudeaza(int x,int y)
{
    if(rang[x]>rang[y])
        tata[y]=x;
    else tata[x]=y;
    if(rang[x]==rang[y])
        rang[y]++;
}

int main()
{
    freopen("apm.in","r",stdin);
    freopen("apm.out","w",stdout);
    scanf("%d%d",&N,&M);
    for(int i=1;i<=M;i++)
    {
        scanf("%d%d%d",&e[i].x,&e[i].y,&e[i].cost);
    }
    sort(e+1,e+M+1,comp);

    for(int i=1;i<=N;i++)
    {
        tata[i]=i;
        rang[i]=0;
    }

    for(int i=1;i<=M;i++)
    {
        int x=e[i].x;
        int y=e[i].y;
        int radx=Radacina(x);
        int rady=Radacina(y);
        if(radx!=rady)
        {
            Sudeaza(radx,rady);
            sol+=e[i].cost;
            ssol[++nredges]=i;
        }
    }
    printf("%d\n",sol);
    printf("%d\n",nredges);
    for(int i=1;i<=nredges;i++)
    {
        printf("%d %d\n",e[ssol[i]].x,e[ssol[i]].y);
    }
}