#include <bits/stdc++.h>
#define Nmax 200000
#define Mmax 400000
using namespace std;

int n,m,total,k,tata[Nmax],rang[Nmax];

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

bool Compare(Muchie x,Muchie y)
{
    return x.c < y.c;
}

pair<int,int> p[Nmax];

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].c;
    }

    sort(v+1,v+m+1,Compare);

    for(int i=1;i<=n;i++)
    {
        tata[i]=i;
        rang[i]=1;
    }
    f.close();
}

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

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

void Afisare()
{
    ofstream g("apm.out");
    g<<total<<"\n";
    g<<k<<"\n";
    for(int i=1;i<=k;i++)
        g<<p[i].first<<" "<<p[i].second<<"\n";
    g.close();
}

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)
        {
            Unire(tata_x,tata_y);
            p[++k].first = v[i].x;
            p[k].second = v[i].y;
            total += v[i].c;
        }
    }
}
int main()
{
    Read();
    Solve();
    Afisare();
    return 0;
}