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

int N, M, nr, dad[100005], cost, K, sol[100005];
struct asd{ int x, y, c; }a[400005];
struct cmp
{
    bool operator()(const asd &A, const asd &B)const
    { return (A.c<B.c); }
};

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

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

int main()
{
    f>>N>>M;
    for (int i=1; i<=N; ++i)
        dad[i]=i;
    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<=M && K!=N-1; ++i)
        if ( grupa(a[i].x)!=grupa(a[i].y) )
        {
            cost+=a[i].c; unite(a[i].x, a[i].y);
            sol[++K]=i;
        }

    g<<cost<<'\n'<<K<<'\n';
    for (int i=1; i<=K; ++i)
        g<<a[sol[i]].x<<' '<<a[sol[i]].y<<'\n';
    return 0;
}