#include <cstdio>
#include <algorithm>
using namespace std;
#define MAX 200020

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

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

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

void APM(){
    sort(u+1,u+m+1,compare);
    for(int i=1;i<=n;i++) rad[i]=i;
    int i=1;
    for(int k=1;k<n;k++)
    {
        while(tata(u[i].x)==tata(u[i].y))i++;
        cost+=u[i].c;
        u[i].c=-1;
        rad[tata(u[i].x)]=tata(u[i].y);
    }
}

int main(){
    freopen("apm.in","r",stdin);
    freopen("apm.out","w",stdout);
        scanf("%d %d",&n,&m);
        for(int i=1;i<=m;i++) scanf("%d %d %d",&u[i].x,&u[i].y,&u[i].c);
    APM();
        printf("%d\n",cost);
        printf("%d\n",n-1);
        for(int i=1;i<=m;i++)
        if(u[i].c==-1)printf("%d %d\n",u[i].x,u[i].y);
}