#include<fstream>
#include<algorithm>
#define MaxM 400005
#define MaxN 200005

using namespace std;

ifstream fin("apm.in");
ofstream fout("apm.out");

struct muchie {
	int x,y,c;
};
muchie v[MaxM],sol[MaxM];

int cmp(muchie a, muchie b)
{	return a.c<b.c;}

int i,j,n,m,t[MaxN],cost,k,a,b,it;

void kruskal()
{	for(i=1;i<=n;i++) t[i]=i;
	i=1;k=0;
	for(i=1;k<n-1;i++)
		if(t[v[i].x]!=t[v[i].y])
		{	cost+=v[i].c;
			k++;
			sol[++it]=v[i];
			a=t[v[i].x];
			b=t[v[i].y];
			for(j=1;j<=n;j++)
				if(t[j]==b) t[j]=a;
		}
}

int main()
{	fin>>n>>m;
	for(i=1;i<=m;i++)	fin>>v[i].x>>v[i].y>>v[i].c;
	sort(v+1,v+1+m,cmp);
	kruskal();
	fout<<cost<<'\n'<<n-1<<'\n';
	for(i=1;i<=n-1;i++)	fout<<sol[i].x<<' '<<sol[i].y<<'\n';
	return 0;
}