#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <cassert>
using namespace std;

#define PRO "apm"
void OpenFiles(int EVAL)
{
	if(EVAL)
	{
		char input[100] = PRO, output[100] = PRO;
		freopen(strcat(input, ".in"),"r",stdin);
		freopen(strcat(output,".out"),"w",stdout);
	} else
	{
		freopen("test.in","r",stdin);
		//freopen("test.out","w",stdout);
	}
}

#define MAX 200002
#define INF 0xffffff

int n,m,rad[MAX];
struct muchie{ int x,y,c; }u[2*MAX];
bool viz[2*MAX];

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

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

void apm()
{
	int cst = 0;
	sort(u+1,u+m+1,cmp);
	//for(int i=1;i<=m;i++) printf("%d %d %d\n",u[i].x,u[i].y,u[i].c);
	for( int i=1;i<=n;i++ ) rad[i] = i;
	int k=1;
	for( int i=1;i<n;i++ )
	{
		while( tata(u[k].x) == tata(u[k].y) )k++;
		cst += u[k].c;
		rad[tata(u[k].x)] = tata(u[k].y);
		viz[k]=1;
		k++;
	}
	printf("%d\n",cst);
	printf("%d\n",n-1);
	for( int i=1;i<=m;i++ )
	if(viz[i]==1)
		printf("%d %d\n",u[i].x,u[i].y);
}

int main(int argv,char *args[])
{
	OpenFiles(argv==0);
	// start
		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();
	return 0;
}