#include <iostream>
#include <stdio.h>
#include <algorithm>
#define NMax 200006
#define MMax 400006
using namespace std;
struct Muchii
{
    int x,y,cost;
}Edges[MMax];
int rang[NMax],Sol[NMax],tata[NMax],N,M,k,rez;

inline bool Compare(Muchii x,Muchii y)
{
    return x.cost<y.cost;
}

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

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",&Edges[i].x,&Edges[i].y,&Edges[i].cost);
    }
    sort(Edges+1,Edges+M+1,Compare);

    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[++k]=i;
            rez=rez+Edges[i].cost;
        }
    }

    printf("%d\n",rez);
    printf("%d\n",k);
    for(int i=1;i<=k;i++)
        printf("%d %d\n",Edges[Sol[i]].x,Edges[Sol[i]].y);
}