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

int N, M, K, dad[200005], cost, sol[200005];

struct asd{int x, y, c;}aux, 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<=M; ++i)
        f>>a[i].x>>a[i].y>>a[i].c;
    for (int i=1; i<=N; ++i) dad[i]=i;

    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; sol[++K]=i;
            unite(a[i].x, a[i].y);
        }
    g<<cost<<' '<<K<<'\n';
    for (int i=1; i<N; ++i)
        g<<a[sol[i]].x<<' '<<a[sol[i]].y<<'\n';
    return 0;
}