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

int N, M, K, sol[200002], cost, GR[200002];
struct muchie{ int x, y, c; }a[400002];
struct cmp
{
    bool operator()(const muchie &A, const muchie &B)const
    { return (A.c<B.c); }
};

int grupa(int nod)
{
    if (GR[nod]==nod) return nod;
    GR[nod]=grupa(GR[nod]);
    return GR[nod];
}

void unite(int x, int y) { GR[grupa(x)]=grupa(y); }

int main()
{
    f>>N>>M;
    for (int i=1; i<=M; ++i)
        f>>a[i].x>>a[i].y>>a[i].c;

    sort(a+1, a+M+1, cmp());
    for (int i=1; i<=N; ++i) GR[i]=i;
    for (int i=1; i<=M && K!=N-1; ++i)
        if (grupa(a[i].x)!=grupa(a[i].y))
            cost+=a[i].c, sol[++K]=i, unite(a[i].x, a[i].y);
    g<<cost<<'\n'<<K<<'\n';
    for (int i=1; i<=K; ++i)
        g<<a[sol[i]].x<<' '<<a[sol[i]].y<<'\n';
    return 0;
}