#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
struct lin{int a,b,cost;};
int cmp(lin a,lin b)
{
    return a.cost<b.cost;
}
lin A[400001];
bool ok[400001];
int P[200001];
int n,m,nrm,sum;
int radacina(int nod)
{
    while(P[nod]!=nod)
        nod=P[nod];
    return nod;
}
int q(int nod)
{
    if(P[nod]!=nod)
        P[nod]=q(P[nod]);
    return P[nod];
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
        fin>>A[i].a>>A[i].b>>A[i].cost;
    for(int i=1;i<=n;i++)
        P[i]=i;
    sort(A+1,A+1+m,cmp);
    for(int i=1;i<=m;i++)
    {
        int x=q(A[i].a);
        int y=q(A[i].b);
        if(x!=y)
        {
            nrm++;
            sum+=A[i].cost;
            P[radacina(x)]=radacina(y);
            ok[i]=1;
        }
    }
    fout<<sum<<"\n"<<nrm<<"\n";
    for(int i=1;i<=m;i++)
    if(ok[i])
    fout<<A[i].a<<" "<<A[i].b<<"\n";
    return 0;
}