#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");

const int NMAX = 200000;
const int MMAX = 400000;
struct muchie
{
    int i, j, c;
};

muchie M[MMAX+1];
int n, m, cost, CC[NMAX+1];
int NrM[NMAX];
void citire()
{
    f >> n >> m;
    for(int i = 1; i <= m; i++)
        f >> M[i].i >> M[i].j >> M[i].c;
}

void afis()
{
    g << cost << '\n';
    g << n-1 << '\n';
    for(int i = 1; i < n; i++)
    {
        int k = NrM[i]; /// Numarul muhciei selectate
        g << M[k].i << ' ' << M[k].j << '\n';
    }
}

bool comp(const muchie &a, const muchie &b)
{
    return a.c < b.c;
}

int compcx(int i)
{
    if(CC[i]==i)
        return i;
    CC[i]=compcx(CC[i]);
    return CC[i];
}

void Kruskal()
{
    sort(M + 1, M + m + 1, comp);
    for(int i = 1; i <= n; i++) ///La inceput fiecare nod constituie
        CC[i] = i;              /// cate o comp conexa
    int nm = 0; ///incepem cu prima muchie
    for(int i = 1; i <=m; i++)
    {
        int ci=compcx(M[i].i);
        int cj=compcx(M[i].j);
        if(ci!=cj)
        {
            cost+=M[i].c;
            CC[ci]=cj;///reuniune cc
            NrM[++nm]=i;
            if(nm==n-1) break;
        }
    }
}
int main()
{
    citire();
    Kruskal();
    afis();
    return 0;
}