#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#define NMax 200005
#define MMax 400005
using namespace std;
struct Muchii
{
    int x,y,z;
}Muchie[MMax];
int N,M,x,y,z,rang[NMax],tata[NMax],Cost;
vector<pair<int,int> > Sol;

inline bool Compare(Muchii a,Muchii b)
{
    return a.z<b.z;
}

void Read()
{
    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);
    }

    for(int i=1;i<=N;i++)
    {
        tata[i]=i;
        rang[i]=1;
    }
    sort(Muchie+1,Muchie+M+1,Compare);
}

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

void APM()
{
    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);
            Sol.push_back(make_pair(Muchie[i].x,Muchie[i].y));
            Cost=Cost+Muchie[i].z;
        }
    }
}

void Write()
{
    printf("%d\n%d\n",Cost,Sol.size());
    for(vector<pair<int,int> >::iterator it=Sol.begin();it!=Sol.end();it++)
        printf("%d %d\n",it->first,it->second);
}

int main()
{
    freopen("apm.in","r",stdin);
    freopen("apm.out","w",stdout);
    Read();
    APM();
    Write();
}