#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1e5 + 5;
typedef long long ll;

int n, m;

struct Edge {
	int u, v, w;
	Edge (int _u = 0, int _v = 0, int _w = 0) :
		u(_u), v(_v), w(_w) {}
} e[N];

int p[N] = {0}, sz[N] = {0};
int fnd(int x) {
	return p[x] == x ? x : p[x] = fnd(p[x]);
} 
void unn(int x, int y) {
	x = fnd(x), y = fnd(y);
	if (x == y)
		return;
	if (sz[x] < sz[y])
		swap(x, y);
	p[y] = x;
	sz[x] += sz[y];
}

int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1, x, y; i <= n; i++)
		scanf("%d%d", &x, &y), p[i] = i, sz[i] = 1;
	for (int i = 1; i <= m; i++)
		scanf("%d%d%d", &e[i].u, &e[i].v, &e[i].w);
 	vector<pair<int, int> > ans;
 	long long mst = 0ll;
 	sort(e + 1, e + m + 1, [](Edge x, Edge y){return x.w > y.w;});
 	for (int i = 1; i <= m; i++)
 		if (fnd(e[i].u) != fnd(e[i].v)) 
 			unn(e[i].u, e[i].v);
		else
			mst += e[i].w, ans.push_back(make_pair(e[i].u, e[i].v));
	cout << mst << endl;
	cout << (int)ans.size() << endl;
	for (auto i: ans)
		cout << i.first << " " << i.second << endl; 
	return 0;
} 
/*
4 5
 1 0
 2 1
 1 2
 0 1
 1 2 1
 2 3 2
 3 4 3
 4 1 4
 1 3 5
*/