#include <fstream>
#include <cstring>
#include <algorithm>
using namespace std;

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

const int N=200005;
const int M=2*N;

int nr[N], t[N];
long long int ctotal;
bool selectat[M];

struct kruskal
{
    int x,y,c;
}v[N], aux;

bool cmp(kurskal a, kruskal b)
{
    return (a.c<b.c);
}

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

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

bool interogare(int x, int y)
{
    return (radacina(x)==radacina(y));
}

int n, m;

int main()
{
    in>>n>>m;
    for(int i=0; i<m; i++)
        in>>v[i].x>>v[i].y>>v[i].c;
    sort(v,v+m, cmp);
    int i=0, nrm=0;
    while(nrm<n-1)
    {
        if(!interogare(v[i].x, v[i].y))
        {
            selectat[i]=true;
            reuniune(v[i].x, v[i].y);
            ctotal+=v[i].c;
            nrm++;
        }
        i++;
    }
    out<<ctotal<<"\n"<<nrm<<"\n";
    for(int i=0; i<m; i++)
        if(selectat[i])
        out<<v[i].y<<" "<<v[i].x<<"\n";
    return 0;
}