#include <cstdio>
#include <vector>

using namespace std;

#define PB push_back
#define MKP make_pair
#define INF 0x3f3f3f3f
#define maxN 200005

int N , M , cost[maxN] , ant[maxN];
bool viz[maxN];

vector <pair <int , int> > lista[maxN] , sol;

int main ()
{
	freopen ("apm.in" , "r" , stdin);
	freopen ("apm.out" , "w" , stdout);
	
	scanf ("%d %d" , &N , &M);
	
	int a , b , c;
	
	for (int i = 1 ; i <= M ; ++i)
	{
		scanf ("%d %d %d" , &a , &b , &c);
		
		lista[a].PB (MKP (b , c));
		lista[b].PB (MKP (a , c));
		
	}
	
	for (int i = 1 ; i <= N ; ++i)
		cost[i] = INF;
	
	cost[1] = 0;
	
	int sol_cost = 0;
	
	
	for (int t = 1 ; t <= N ; ++t)
	{
		int best_cost = INF , best_nod;
		
		for (int i = 1 ; i <= N ; ++i)
			if (cost[i] < best_cost && !viz[i])
			{
				best_cost = cost[i];
				best_nod = i;
			}
		
		sol_cost += best_cost;
		
		viz[best_nod] = true;
		sol.PB (MKP (ant[best_nod] , best_nod));
		
		
		for (unsigned int i = 0 ; i < lista[best_nod].size () ; ++i)
		{
			int nodcur = lista[best_nod][i].first;
			int costcur = lista[best_nod][i].second;
			
			if (viz[nodcur]) continue;
			if (costcur >= cost[nodcur]) continue;
			
			
			cost[nodcur] = costcur;
			ant[nodcur] = best_nod; 
		}
	}
	
	
	printf ("%d\n%d\n" , sol_cost , sol.size () - 1);
	
	for (unsigned int i = 1 ; i < sol.size () ; ++i)
		printf ("%d %d\n" , sol[i].first , sol[i].second);
	
	
	return 0;
}