#include <bits/stdc++.h>
using namespace std;
#define int long long

#define fi first
#define se second
#define vi vector<int>
#define pb push_back
#define pii pair<int,int>
#define mkp make_pair
#define debug(x) cout << #x << " = " << x << "\n";

int rd() {
	int x = 0, f = 1;
	char ch = getchar();
	while (!('0' <= ch && ch <= '9')) {
		if (ch == '-') f = -1; ch = getchar();
	}
	while ('0' <= ch && ch <= '9') {
		x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar();
	}
	return x * f;
}

void wr(int x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) wr(x / 10); putchar(x % 10 + '0');
}
bool MemoryST;
int Testcase = 0;

const int N = 5e5 + 10;
const int inf = 1e18 + 1;

struct tree {
	int ls, rs, mn, mx;
	tree() {
		ls = rs = 0; mn = inf; mx = -inf;
	}
} t[N * 40];
int tot, rt[N];

vi e[N];

vi qe[N];
int w[N], lst[N];
int fa[N], qu[N], qv[N], ans[N];

int deg[N], vsi[N];

int n, m, k, xp[N], yp[N];
int U[N * 3], V[N * 3], W[N * 3], vs[N * 3], nod[N * 3];

void init() {
	for (int i = 0; i <= tot; ++i)
		t[i].ls = t[i].rs = 0;
	tot = 0;
	for (int i = 1; i <= n; ++i)
		rt[i] = w[i] = lst[i] = fa[i] = vsi[i] = deg[i] = 0, e[i].clear(), qe[i].clear();
	for (int i = 1; i <= m; ++i)
		vs[i] = nod[i] = 0;
}

void pushup (int x) {
	t[x].mn = min(t[t[x].ls].mn, t[t[x].rs].mn);
	t[x].mx = max(t[t[x].ls].mx, t[t[x].rs].mx);
}

void update (int &x, int l, int r, int k, int v) {
	if (!x) x = ++tot, assert(tot <= N * 40);
	if (l == r) {
		t[x].mn = t[x].mx = v; return ;
	}
	int mid = (l + r) >> 1;
	if (k <= mid) update(t[x].ls, l, mid, k, v);
	else update(t[x].rs, mid + 1, r, k, v);
	pushup(x);
}

int query (int x, int l, int r, int L, int R, int lv, int rv, int dic, int dep = 0) {
	assert(dep <= 30);
//	cout << x << " " << l << " " << r << " " << L << " " << R << " " << lv << " " << rv << " " << dic << "\n";
	if (!x) return -1;
	if (r < L || l > R) return -1;
	if (lv <= t[x].mn && t[x].mx <= rv) return -1;
	if (l == r) return l;
	int mid = (l + r) >> 1, p;
	if (dic) {
		p = query(t[x].ls, l, mid, L, R, lv, rv, dic);
		if (p == -1) p = query(t[x].rs, mid + 1, r, L, R, lv, rv, dic, dep + 1);
	} else {
		p = query(t[x].rs, mid + 1, r, L, R, lv, rv, dic);
		if (p == -1) p = query(t[x].ls, l, mid, L, R, lv, rv, dic, dep + 1);
	}
	return p;
}

void upd (int u, int d, int id) {
	int L = lst[u], R = id - 1;
//	cout << "upd :: " << u << " " << d << "\n";
	for (auto p : e[u]) {
		if (vs[p] <= k) continue;
		int l = query(rt[V[p]], 0, k, 0, L, inf, -inf, 0);
		int q = query(rt[V[p]], 0, k, l, R, w[u] - W[p], w[u] + W[p], 1);
//		cout << "query :: " << V[p] << " " << l << " " << L << " " << R << " " << w[V[p]] - W[p] << " " << w[V[p]] + W[p] << " is " << q << "\n";
		if (q >= 0)
			vs[p] = max(L, q);
	} 
	if (id <= k) update(rt[u], 0, k, id, (w[u] += d));
	lst[u] = id;
}

int find (int x) {
	if (fa[x] == x) return x;
	return fa[x] = find(fa[x]);
}

void get_ans() {
	for (int i = 1; i <= m; ++i)
		nod[i] = i;
	sort (nod + 1, nod + m + 1, [&](int x, int y) {
		return vs[x] > vs[y];
	});
	for (int i = 1; i <= n; ++i)
		fa[i] = i;
	for (int j = 1; j <= m; ++j) {
		int i = nod[j], u = find(U[i]), v = find(V[i]);
		if (u == v) continue ;
		if (qe[u].size() < qe[v].size()) swap(u, v);
		fa[v] = u;
		for (auto p : qe[v]) {
			if (find(qu[p]) == find(qv[p])) ans[p] = max(ans[p], vs[i]);
			else qe[u].pb(p); 
		}
	}
}

int get_sqrt(int x) {
	int l = 0, r = 1e9;
	while (l < r) {
		int mid = (l + r) >> 1;
		if ((mid + 1) * (mid + 1) <= x) l = mid + 1;
		else r = mid;
	}
	return l;
}

void Mainsolve() {
	cin >> n;
	for (int i = 1; i <= n; ++i)
		cin >> xp[i] >> yp[i];
	cin >> m;
	for (int i = 1; i <= m; ++i) {
		int u, v, l; cin >> u >> v >> l;
		l = l * l - (xp[u] - xp[v]) * (xp[u] - xp[v]) - (yp[u] - yp[v]) * (yp[u] - yp[v]);
		W[i] = get_sqrt(l); U[i] = u; V[i] = v;
		++deg[u]; ++deg[v];
	}
	priority_queue<pii> q;
	for (int i = 1; i <= n; ++i)
		q.push(mkp(-deg[i], i));
	int rk = 0;
	while (!q.empty()) {
		int u = q.top().se; q.pop(); 
		if (vsi[u]) continue ; vsi[u] = ++rk;
		for (auto v : e[u]) {
			if (!vsi[v]) --deg[v], q.push(mkp(-deg[v], v));
		}
	}
	cin >> k;
	for (int i = 1; i <= n; ++i) {
		update(rt[i], 0, k, 0, 0); 
	}
	for (int i = 1; i <= m; ++i) {
		if (vsi[U[i]] > vsi[V[i]]) swap(U[i], V[i]);
		e[U[i]].pb(i);
		vs[i] = k + 1;
	}
	for (int i = 1; i <= k; ++i) {
		int v, h; cin >> v >> h; upd(v, h, i);
//		cout << "\n\nAt time :: " << i << " is \n";
//		for (int j = 1; j <= n; ++j)
//			cout << w[j] << " "; cout << "\n\n\n";
	}
	for (int i = 1; i <= n; ++i) upd(i, 0, k + 1);
	int Q; cin >> Q;
	for (int i = 1; i <= Q; ++i) {
		cin >> qu[i] >> qv[i];
		qe[qu[i]].pb(i); qe[qv[i]].pb(i);
		ans[i] = -1;
	}
	get_ans();
	for (int i = 1; i <= Q; ++i)
		if (ans[i] > k) ans[i] = -1;
	for (int i = 1; i <= Q; ++i)
		cout << ans[i] << "\n";
	init();
}

bool MemoryED;
signed main() {
//	freopen ("show.in", "r", stdin);
//	freopen ("show.out", "w", stdout);
	ios::sync_with_stdio(false); cin.tie(0); //cout.tie(0);

	cerr << fixed << setprecision(6) << (&MemoryST - &MemoryED) / 1024.0 << "KB\n";

	int T; cin >> T;
	while (T--) Testcase++, Mainsolve();

	cerr << endl << 1e3 * clock() / CLOCKS_PER_SEC << "ms\n";

//	system("fc .out .out");
	return 0;
}