#include<fstream>
#include<vector>
#include<algorithm>
#include<queue>
#define INF (1<<30)
#define NMAX 105
#define PI pair<int,int> 
#define VEC G[nod][i].first
#define COST G[nod][i].second
using namespace std;
int n,m;
vector<PI> G[NMAX],sol;
priority_queue< PI,vector<PI>,greater<PI> > HEAP;
int V[NMAX],vec[NMAX],d;
bool use[NMAX];
void read()
{
	ifstream fin("apm.in");
	fin>>n>>m;
	int x,y,z;
	while(fin>>x>>y>>z)
	{
		G[x].push_back(make_pair(y,z));
		G[y].push_back(make_pair(x,z));
		m++;
	}
	fin.close();
}
void apm(int nod)
{
    for(size_t i=0;i<G[nod].size();i++)
    {
        V[VEC]=min(V[VEC],COST);
        if(V[VEC]==COST)
			vec[VEC]=nod;
    }
}
void init()
{
	for(int i=1;i<=n;i++)
		V[i]=INF;
	V[1]=0;
}
void print()
{
	ofstream fout("apm.out");
	fout<<d<<'\n';
	fout<<n-1<<'\n';
	for(size_t i=0;i<sol.size();i++)
		fout<<sol[i].first<<' '<<sol[i].second<<'\n';
	fout.close();
}
int main()
{
	int nod;
	read();
	init();
	apm(1);
	for(int i=2;i<=n;i++)
		HEAP.push(make_pair(V[i],i));
	for(int j=1;j<n;j++)
	{
		nod=HEAP.top().second;
		HEAP.pop();
		if(use[nod])
			continue;
		use[nod]=1;
		apm(nod);
		d+=V[nod];
		sol.push_back(make_pair(nod,vec[nod]));
		for(int i=2;i<=n;i++)
			if(!use[i])
				HEAP.push(make_pair(V[i],i));
	}
	print();
	return 0;
}