#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream fin ("apm.in");
ofstream fout ("apm.out");
const int nmax = 200005;
const int mmax = 400005;
struct muchie { int x, y, cost;};
vector <pair<int,int> > arb;
int n, m, final_cost, tata[nmax], rang[nmax];
muchie graf[mmax];
inline bool cmp(muchie a, muchie b)
{
    if(a.cost<b.cost) return 1;
    return 0;
}
int radacina(int nod)
{
    while(tata[nod]!=nod) nod=tata[nod];
    return nod;
}
void lipire(int x, int y)
{
    if(rang[x]>rang[y]) tata[y]=x;
    else tata[x]=y;
    if(rang[x]==rang[y]) rang[y]++;
}
void Kruskal()
{
    int i, rx, ry;
    sort(graf+1, graf+m+1, cmp);
    for(i=1; i<=n; i++)
        tata[i]=i;
    for(i=1; i<=m; i++)
    {
        rx=radacina(graf[i].x);
        ry=radacina(graf[i].y);
        if(rx!=ry)
        {
            lipire(rx, ry);
            final_cost+=graf[i].cost;
            arb.push_back(make_pair(graf[i].x, graf[i].y));
        }
    }

}
int main()
{
    int i;
    fin >> n >> m;
    for(i=1; i<=m; i++)
        fin >> graf[i].x >> graf[i].y >> graf[i].cost;
    Kruskal();
    fout << final_cost << "\n" << arb.size() << "\n";
    for(i=0; i<arb.size(); i++)
        fout << arb[i].first << " " << arb[i].second << "\n";
    fin.close();
    fout.close();
    return 0;
}