#include<iostream>
#include<fstream>
#include<vector>
#include<algorithm>
#define M_MAX 400005
#define N_MAX 200006
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
struct muchie
{
	int a,b,c;
}aux;
class Compare 
{ 
	public:     
	bool operator()(const muchie& x, const muchie& y) const
    {
		return x.c > y.c;
	}
};
long s;
int n,m;
int comp[N_MAX];
vector<muchie> muchii,apm;
int grupa(int i) 
{
	if (comp[i] == i) 
		return i;
	comp[i] = grupa(comp[i]);
	return comp[i]; 
}   
void reuniune(int i,int j) 
{
	comp[grupa(i)] = grupa(j);  
} 
int main()
{
	f>>n>>m;
	for(int i=0;i<m;i++)
	{
		f>>aux.a>>aux.b>>aux.c;
		muchii.push_back(aux);
		comp[i+1] = i+1;
	}
	make_heap(muchii.begin(), muchii.end(), Compare());
	while(muchii.size())
	{
		if(grupa(muchii[0].a) != grupa(muchii[0].b))
		{
			reuniune(muchii[0].a,muchii[0].b);
			apm.push_back(muchii[0]);
			s+=muchii[0].c;
		}
		pop_heap(muchii.begin(),muchii.end(),Compare());
		muchii.pop_back();
	}
	g<<s<<'\n'<<apm.size()<<'\n';
	for(unsigned int i=0;i<apm.size();i++)
		g<<apm[i].a<<" "<<apm[i].b<<'\n';
	return 0;
}