#include <cstdio>
#include <algorithm>
using namespace std;
#define MAX 200002
#define INF 0xffffff

struct muchie{ int x,y,c; }u[2*MAX];
int rad[MAX],n,m;

bool sort_type(muchie a,muchie b){ return a.c<b.c; }

int tata(int x){
    if(x != rad[x])rad[x] = tata(rad[x]);
    return rad[x];
}

void apm(){
    int cost = 0;
    sort(u,u+m,sort_type);
    //for(int i=0;i<m;i++)printf("%d\n",u[i].c);

    for(int i=1;i<=n;i++)rad[i]=i;

    int i = 0;
    for(int k=1;k<n;k++)
    {
        while(tata(u[i].x)==tata(u[i].y))i++;
        cost += u[i].c;
        u[i].c = INF;
        rad[tata(u[i].x)] = tata(u[i].y);
    }
    printf("%d\n",cost);
    printf("%d\n",n-1);
    for(int i=0;i<m;i++)
    if(u[i].c == INF) printf("%d %d\n",u[i].x,u[i].y);
}

int main(){
    freopen("apm.in","r",stdin);
    freopen("apm.out","w",stdout);
        scanf("%d %d",&n,&m);
        for(int i=0;i<m;i++)
            scanf("%d %d %d",&u[i].x,&u[i].y,&u[i].c);
    apm();
    return 0;
}