#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <algorithm>
#include <utility>
#include <string>
#include <functional>
#include <sstream>
#include <fstream>
#include <iostream>
using namespace std;
#define FOR(i,a,b) for (i=a;i<=b;i++)
#define fori(it,v) for (it=(v).begin();it!=(v).end();it++)
#define pb push_back
#define mp make_pair
#define fs first
#define ss second
#define all(c) c.begin(),c.end()
#define pf push_front
#define popb pop_back
#define popf pop_front
FILE *in,*out;
vector<pair<int,pair<int,int> > > b;
int sol[200005],c[200005];
int rep(int x)
{
	if (x==c[x])
		return x;
	return c[x]=rep(c[x]);
}
int main()
{
	int n,m,i,x,y,z,cost=0,nr=0,r1,r2;
	in=fopen("apm.in","r");
	out=fopen("apm.out","w");
	fscanf(in,"%d%d",&n,&m);
	FOR(i,1,m)
	{
		fscanf(in,"%d%d%d",&x,&y,&z);
		b.pb(mp(z,mp(x,y)));
	}
	FOR(i,1,n)
		c[i]=i;
	sort(all(b));
	nr=0;
	i=0;
	while (nr!=n-1)
	{
		r1=rep(b[i].ss.fs);
		r2=rep(b[i].ss.ss);
		if (r1!=r2)
		{
			cost+=b[i].fs;
			nr++;
			sol[nr]=i;
			c[r1]=r2;
		}
		i++;
	}
	fprintf(out,"%d\n%d\n",cost,nr);
	FOR(i,1,n-1)
		fprintf(out,"%d %d\n",b[sol[i]].ss.fs,b[sol[i]].ss.ss);
	fclose(in);
	fclose(out);
	return 0;
}