#include <cstdio>
#include <algorithm>

using namespace std;

struct edge
{
    int x,y,c;
    bool operator <(const edge &aux) const
    {
        return c<aux.c;
    }
}v[400010];
pair<int,int> sol[200010];
int rad[200010],size[200010];

int radacina(int nod)
{
    int i=nod,j=nod;
    for(;i!=rad[i];i=rad[i]);
    while(j!=i)
    {
        int aux=rad[j];
        rad[j]=i;
        j=aux;
    }
    return i;
}

int main()
{
    freopen("apm.in", "r", stdin);
    freopen("apm.out", "w", stdout);
    int n,m,nr=0,sum=0;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++) scanf("%d%d%d",&v[i].x,&v[i].y,&v[i].c);
    sort(v+1,v+1+m);
    for(int i=1;i<=n;i++) {rad[i]=i;size[i]=1;}
    for(int i=1;i<=m;i++)
    {
        int a=radacina(v[i].x),b=radacina(v[i].y);
        if(a!=b)
        {
            if(size[a]<size[b]) swap(a,b);
            rad[a]=b;
            size[a]+=size[b];
            sum+=v[i].c;
            sol[++nr]={v[i].x,v[i].y};
        }
    }
    printf("%d\n%d\n",sum,nr);
    for(int i=1;i<=nr;i++) printf("%d %d\n",sol[i].first,sol[i].second);
    return 0;
}