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

struct Muchie
{
    int x,y,z;
}Edges[MMax];
int N,M,tata[NMax],rang[NMax],cost,sol;
int Sol[NMax];

void Read()
{
    scanf("%d%d",&N,&M);
    for(int i=1;i<=M;i++)
    {
        scanf("%d%d%d",&Edges[i].x,&Edges[i].y,&Edges[i].z);
    }
}
bool Comp(Muchie a,Muchie b)
{
    return a.z < b.z;
}
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];
}
void Solve()
{
    sort(Edges+1, Edges+M+1, Comp);
    for(int i = 1; i <= N; i++)
    {
        tata[i] = i;
    }
    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);
            cost = cost + Edges[i].z;
            ++sol;
            Sol[sol] = i;
        }
    }
}
void Write()
{
    printf("%d\n",cost);
    printf("%d\n",sol);
    for(int i=1;i<=sol;i++)
    {
        printf("%d %d\n",Edges[Sol[i]].x,Edges[Sol[i]].y);
    }
}
int main()
{
    freopen("apm.in","r",stdin);
    freopen("apm.out","w",stdout);
    Read();
    Solve();
    Write();
    return 0;
}