#ifdef ONLINE_JUDGE
	#include <bits/stdc++.h>
#else
	#include <algorithm>
	#include <bitset>
	#include <cassert>
	#include <cmath>
	#include <cstdio>
	#include <cstdlib>
	#include <cstring>
	#include <iostream>
	#include <map>
	#include <set>
	#include <stack>
	#include <string>
	#include <utility>
	#include <vector>
	#include <queue>
	#include <climits>
#endif

using namespace std;

	// lambda : [] (int a, int b) -> bool { body return }
	// string r_str = R"(raw string)"

#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define pb push_back
#define LL long long
#define ULL unsigned long long
#define BASE 73
#define NMAX 10000
#define NMAX2 20001
#define MOD1 1000000007
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
#define CRLINE Duxar(__LINE__);
#define SHOWME(x) cerr << __LINE__ << ": " << #x << " = " << (x) << endl;
#define ENTER putchar('\n');

int dx4[] = {-1, 0, 1, 0};
int dy4[] = {0, 1, 0, -1};

int dx8[] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};

void Duxar(int _this_line) {
#ifndef ONLINE_JUDGE
	printf("\n . . . . . . . . . . . . . Passed line - %d\n", _this_line);
#endif
}

template <class T>
void ReadNo(T &_value) {
	T _sign = 1;
	char ch;
	_value = 0;
	while(!isdigit(ch = getchar())) {
		(ch == '-') && (_sign = -1);
	}
	do {
		_value = _value * 10 + (ch - '0');
	} while(isdigit(ch = getchar()));
	_value *= _sign;
}

int N, M;
vector <bool> added;
vector <vector <pair <int, int> > > graph;
vector <pair <int, int> > result, best;
priority_queue <pair <int, int> > heap;

int main(){
	string file_input = "apm";
#ifdef INFOARENA
	freopen((file_input + ".in").c_str(), "r", stdin);
	freopen((file_input + ".out").c_str(), "w", stdout);
#else
#ifndef ONLINE_JUDGE
	freopen("input.cpp", "r", stdin);
#endif
#endif
	
	int i, ans = 0, x, y, c, iam;
	
	ReadNo(N); ReadNo(M);
	added.resize(N + 1);
	graph.resize(N + 1);
	best.resize(N + 1);
	
	for (i = 0; i < M; ++i) {
		ReadNo(x); ReadNo(y); ReadNo(c);
		graph[y].pb(mp(x, c));
		graph[x].pb(mp(y, c));
	}
	added[1] = true;
	for (auto to: graph[1]) {
		y = to.first;
		c = to.second;
		if (best[y].second == 0 || (!added[y] && best[y].first > c)) {
			best[y] = mp(c, 1);
			heap.push(mp(-c, y));
		}
	}
	while (!heap.empty()) {
		c = -heap.top().first;
		iam = heap.top().second;
		heap.pop();
		if (added[iam]) {
			continue;
		}
		added[iam] = true;
		ans += c;
		result.pb(mp(best[iam].second, iam));
		for (auto to: graph[iam]) {
			y = to.first;
			c = to.second;
			if (best[y].second == 0 || (!added[y] && best[y].first > c)) {
				best[y] = mp(c, iam);
				heap.push(mp(-c, y));
			}
		}
	}
	
	printf("%d\n%d\n", ans, N - 1);
	for (i = 0; i < N - 1; ++i) {
		printf("%d %d\n", result[i].first, result[i].second);
	}
	
	return 0;
}