#include <bits/stdc++.h>
#define Nmax 200000
#define Mmax 400000

#define x first
#define y second
using namespace std;

unsigned int n,m,k,total,tata[Nmax],rang[Nmax];
pair<int,int> p[Nmax];

struct Muchie{
    int x,y,cost;
}v[Mmax];

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

void Read(){
    ifstream f("apm.in");

    f>>n>>m;
    for(int i=1;i<=m;i++)
        f>>v[i].x>>v[i].y>>v[i].cost;

    sort(v+1,v+m+1,Compare);
    for(int i=1;i<=n;i++){
        rang[i]=1;
        tata[i]=i;
    }

    f.close();
}
void Afisare(){
    ofstream g("apm.out");

    g<<total<<"\n";
    g<<k<<"\n";
    for(int i=1;i<=k;i++)
        g<<p[i].x<<" "<<p[i].y<<"\n";

    g.close();
}
int Find(int nod){
    while(nod != tata[nod])
        nod = tata[nod];
    return nod;
}

void Uneste(int x,int y)
{
    if(rang[x] < rang[y])
        tata[x] = y;
    if(rang[y] < rang[x])
        tata[y] = x;
    if(rang[x]==rang[y]){
        tata[x] = y;
        rang[y]++;
    }
}

void Solve()
{
    for(int i=1;i<=m;i++){
        int tata_x = Find(v[i].x);
        int tata_y = Find(v[i].y);
        if(tata_x != tata_y){
            Uneste(tata_x,tata_y);
            p[++k].x = v[i].x;
            p[k].y = v[i].y;
            total += v[i].cost;
        }
    }
    Afisare();
}

int main()
{
    Read();
    Solve();
    return 0;
}