#include <bits/stdc++.h>
#define nmax  200001
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
int t[nmax],n,m;
struct Patru
{
    int ox,oy,c,test;
};
Patru a[nmax];
void Citire()
{
    int i;
    fin>>n>>m;
    for(i=1;i<=m;i++)
        fin>>a[i].ox>>a[i].oy>>a[i].c;
}
inline bool Sortare(const Patru A,const Patru B)
{
    return A.c<B.c;
}
inline void Union(int x,int y)
{
    t[y]=x;
}
inline int Find(int x)
{
    int rad,y;
    rad=x;
    while(t[rad])
        rad=t[rad];
    while(x!=rad)
    {
        y=t[x];
        t[x]=rad;
        x=y;
    }
    return x;
}
void Rezolvare()
{
    int i,sol=0,x,y;
    sort(a+1,a+m+1,Sortare);
    for(i=1;i<=m;i++)
    {
        x=Find(a[i].ox);
        y=Find(a[i].oy);
        if(x!=y)///nu exista cicluri
        {
            sol+=a[i].c;
            Union(x,y);
            a[i].test=1;
        }
    }
    fout<<sol<<"\n"<<n-1<<"\n";///ca un graf sa fie arbore trebuie sa contina n-1 varfuri
    for(i=1;i<=m;i++)
        if(a[i].test==1)
            fout<<a[i].ox<<" "<<a[i].oy<<"\n";
}
int main()
{
    Citire();
    Rezolvare();
    fin.close();
    fout.close();
    return 0;
}