#include <iostream>
#include <stdio.h>
#include <algorithm>
#define MMax 400006
#define NMax 200006
using namespace std;
struct muchie
{
    int x,y,z;
}Muchie[MMax];

int N,M,rang[NMax],tata[NMax],sol,k,ssol[NMax];

void Citire()
{
    scanf("%d%d",&N,&M);
    for(int i=1;i<=M;i++)
    {
        scanf("%d%d%d",&Muchie[i].x,&Muchie[i].y,&Muchie[i].z);
    }
}

bool Comp(muchie a,muchie b)
{
    return a.z<b.z;
}

int Radacina(int x)
{
    while(x!=tata[x])
        x=tata[x];
    return 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]++;
}

void Krustal()
{
    sort(Muchie+1,Muchie+1+M,Comp);

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

    for(int i=1;i<=M;i++)
    {
        int x=Muchie[i].x;
        int y=Muchie[i].y;
        int radx=Radacina(x);
        int rady=Radacina(y);
        if(radx!=rady)
        {
            Sudeaza(radx,rady);
            ssol[++k]=i;
            sol=sol+Muchie[i].z;
        }
    }
}

int main()
{
    freopen("apm.in","r",stdin);
    freopen("apm.out","w",stdout);
    Citire();
    Krustal();
    printf("%d\n",sol);
    printf("%d\n",k);
    for(int i=1;i<=k;i++)
        printf("%d %d\n",Muchie[ssol[i]].x,Muchie[ssol[i]].y);
}