#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
int t[100001];
int n,m,nrc,costMn;
struct muchie
{
    int x,y,c;//muchia (x,y) de cost c
    bool ales;//ales=true daca muchia este in APM
    bool operator< (const muchie A) const
    {
        return c<A.c;
    }
}a[400002];
void Union(int x,int y)
{
    t[y]=x;
}
int Find(int x)
{int rad,y;
    rad=x;
    while(t[rad]!=0)rad=t[rad];
    //comprimam
    while(x!=rad)
    {
        y=t[x];
        t[x]=rad;
        x=y;
    }
    return rad;
}
void Kruskal()
{
    int i,x,y;
    sort(a+1,a+m+1);
    //for(i=1;i<=m;i++)g<<a[i].x<<" "<<a[i].y<<" "<<a[i].c<<'\n';
    nrc=n;
    for(i=1;i<=m && nrc>1;i++)
    {
        x=Find(a[i].x);
        y=Find(a[i].y);
        if(x!=y)
            {
                Union(x,y);
                 nrc--;
                 a[i].ales=true;
                 costMn=costMn+a[i].c;
            }
    }
}
int main()
{
    int i;
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>a[i].x>>a[i].y>>a[i].c;
    }
    Kruskal();
    g<<costMn<<'\n';
    g<<n-1<<'\n';
    for(i=1;i<=m;i++)
        if(a[i].ales==true)g<<a[i].x<<" "<<a[i].y<<'\n';
    f.close();
    g.close();
    return 0;
}