#include <vector>
#include <algorithm>
#include <fstream>

using namespace std;

ifstream fin("apm.in");
ofstream fout("apm.out");

const int maxn = 200005;

int n, m, father[maxn];
inline int find(int x) {
	if(father[x] != x)
		father[x] = find(father[x]);
	return father[x];
}

inline bool unite(int x, int y) {
	x = find(x);
	y = find(y);
	if(x == y)
		return false;
	father[x] = y;
	return true;
}

inline void kruskal() {
	vector <pair<int, pair<int, int> > > edges;
	fin >> n >> m;
	for(int i = 1 ; i <= n ; ++ i)
		father[i] = i;
	for(int i = 1 ; i <= m ; ++ i) {
		int x, y, z;
		fin >> x >> y >> z;
		edges.push_back(make_pair(z, make_pair(x, y)));
	}
	sort(edges.begin(), edges.end());
	int total = 0;
	vector <pair<int, int> > apm;
	for(int i = 0 ; i < edges.size() ; ++ i) {
		if(unite(edges[i].second.first, edges[i].second.second)) {
			total += edges[i].first;
			apm.push_back(edges[i].second);
		}
	}
	fout << total << '\n' << n - 1 << '\n';
	for(auto it : apm)
		fout << it.first << ' ' << it.second << '\n';
}

int main(){
	kruskal();
}