#include <stdio.h>
#include <algorithm>
using namespace std;

int n,m,up[200002],r1,r2,arb[200002];
struct muchie {int x,y,c;} v[400002];

int radacina(int x){
  if (up[x]==x) return x;
  up[x]=radacina(up[x]);
  return up[x];
}

bool cmpf(muchie i,muchie j){return i.c<j.c;}

int main()
{
  int k=0,cost=0;
  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",&v[i].x,&v[i].y,&v[i].c);
  sort(v+1,v+m+1,cmpf);
  for (int i=1; i<=n; i++) up[i]=i;
  for (int i=1;i<=m && k<n-1; i++){
    r1=radacina(v[i].x);
    r2=radacina(v[i].y);
    if (r1!=r2){
      cost+=v[i].c;
      arb[++k]=i;
      up[r2]=r1;
    }
  }
  printf("%d\n%d\n",cost,n-1);
  for (int i=1;i<=k;i++)
    printf("%d %d\n",v[arb[i]].x,v[arb[i]].y);
  return 0;
}