#include<stdio.h>
#include<algorithm>
using namespace std;
struct bine { int x ; int y ; int cost ;};
bine v[400001];
struct bine2 { int xx; int yy;};
bine2 v2[400001];
int dad[200001];
int n,m;
bool sortare ( bine a , bine b ){
    return a.cost<b.cost;
}
void citire (){
    int i;
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++)
        scanf("%d%d%d",&v[i].x,&v[i].y,&v[i].cost);
    sort(v+1,v+m+1,sortare);
}
int  tata ( int x ){
    if(dad[x]==x)
        return x;
    return dad[x]=tata(dad[x]);
}
void join ( int a, int b){
    int ra,rb;
    ra=tata(a);
    rb=tata(b);
    dad[ra]=rb;
}
int main(){
    int i,k,s=0;
    freopen("apm.in","r",stdin);
    freopen("apm.out","w",stdout);
    citire();
    for(i=1;i<=n;i++)
        dad[i]=i;
    k=0;
    for(i=1;i<=m;i++)
        if(tata(v[i].x)!=tata(v[i].y)){
           k++;
           v2[k].xx=v[i].x;
           v2[k].yy=v[i].y;
           join(v[i].x,v[i].y);
           s=s+v[i].cost;
        }
    printf("%d\n%d\n",s,k);
    for(i=1;i<=k;i++)
        printf("%d %d\n",v2[i].xx,v2[i].yy);
    return 0;
}