#include <algorithm>
#include <fstream>
#include <vector>
#include <bitset>
using namespace std;

ifstream in("apm.in");
ofstream out("apm.out");

const int NMAX = 200001;
int t[NMAX],nr[NMAX],n,m;
bitset <NMAX> folosit;


struct muchie
{
    int x,y,c;
};

muchie M[NMAX];

bool cmp(muchie m1, muchie m2)
{
    return(m1.c < m2.c);
}

int radacina(int x)
{
    if(t[x] == 0)
    {
        return x;
    }
    return radacina(t[x]);
}

void reuniune(int x,int y)
{
    int rx = radacina(x);
    int ry = radacina(x);
    if(nr[rx] < nr[ry])
    {
        t[rx] = t[ry];
        nr[ry] += nr[rx];
    }
    else
    {
        t[ry] = t[rx];
        nr[rx] += nr[ry];
    }
}
bool verificare(int x,int y)
{
    return (radacina(x) == radacina(y));
}

int kruskal()
{
    sort(M,M+m,cmp);
    int cost = 0,nrm = 0,i = 0;
    while(nrm < n-1)
    {
        if(!verificare(M[i].x,M[i].y))
        {
            folosit[i] = true;
            nrm++;
            cost += M[i].y;
            reuniune(M[i].x,M[i].y);
        }
        i++;
    }
    return cost;
}


int main(int argc, const char * argv[])
{
    in >> n >> m;
    for(int i = 0; i < m; i++)
    {
        in >> M[i].x >> M[i].y >> M[i].c;
    }
    out << kruskal() << " " << n - 1 << "\n";
    for(int i = 0; i < m; i++)
    {
        if(folosit[i])
        {
            out << M[i].x << " " << M[i].y;
            out << "\n";
        }
    }
    in.close();
    return 0;
}