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

struct Muchie
{
    int x;
    int y;
    int cost;
}edges[MMax];
int tata[NMax],rang[NMax],ssol[NMax],N,M,k,sol;

bool Comp(Muchie a,Muchie b)
{
    return (a.cost<b.cost);
}

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

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 Read()
{
    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",&edges[i].x,&edges[i].y,&edges[i].cost);
    }
    sort(edges+1,edges+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=edges[i].x;
        int y=edges[i].y;
        int radx=Radacina(x);
        int rady=Radacina(y);

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

}

int main()
{
    Read();
}