// Not afraid to dark.

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

#define inline __inline__ __attribute__ ((always_inline))

#define int long long

namespace io {
	int pos;
	inline int read (int &p = pos){
		static int v; static char c;
		v = 1, c = getchar (), p = 0;
		while (! isdigit (c)){
			if (c == '-')
				v = - 1;
			c = getchar ();
		}
		while (isdigit (c)){
			p = (p << 1) + (p << 3) + (c - 48);
			c = getchar ();
		}
		return p *= v;
	}
	inline void write (int x){
		if (x < 0)
			putchar ('-'), x = - x;
		static int sta[65], top;
		top = 0;
		do {
			sta[++ top] = x % 10;
			x /= 10;
		} while (x);
		while (top)
			putchar (sta[top --] + 48);
	}
};

const int N = 5e5, M = N * 3;

int n, m, t, q;
int x[N + 5], y[N + 5], z[N + 5], lim[M + 5];
struct edge {
	int u, v, l, tg;
} eg[M + 5];
vector < int > to[N + 5];
vector < pair < int , int > > fw[N + 5];
int deg[N + 5];

inline int RD (int x, int y, int z){
	return x * x + y * y + z * z;
}

set < pair < int , int > > sl[N + 5], sr[N + 5];
int ie[M + 5], fa[N + 5];

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

int firs[N + 5], nex[N * 2 + 5], eto[N * 2 + 5], w[N * 2 + 5], tot;
int dep[N + 5], gf[N + 5][20], gg[N + 5][20];
inline void Add (int u, int v, int l){
	++ tot;
	nex[tot] = firs[u];
	firs[u] = tot;
	eto[tot] = v;
	w[tot] = l;
}

void init (int u, int father, int wt = t + 1){
	dep[u] = dep[father] + 1;
	gf[u][0] = father;
	gg[u][0] = wt;
	for (int i = 1;i < 20;++ i){
		gf[u][i] = gf[gf[u][i - 1]][i - 1];
		gg[u][i] = min (gg[u][i - 1], gg[gf[u][i - 1]][i - 1]);
	}
	for (int e = firs[u], v;e;e = nex[e]){
		v = eto[e];
		if (v == father)
			continue;
//		printf (">%lld %lld %lld\n", u, v, w[e]);
		init (v, u, w[e]);
	}
}

inline int LCA (int u, int v){
	if (dep[u] < dep[v])
		swap (u, v);
	for (int i = 19;i >= 0;-- i)
		if (dep[gf[u][i]] >= dep[v])
			u = gf[u][i];
	if (u == v)
		return u;
	for (int i = 19;i >= 0;-- i)
		if (gf[u][i] != gf[v][i]){
			u = gf[u][i];
			v = gf[v][i];
		}
	return gf[u][0];
}

int T;
//int TT;

inline void ARKNIGHTS (){
//	int xx = 157, yy = 713;
//	if (xx > yy)
//		swap (xx, yy);
	
	
	io::read (n);
	for (int i = 1;i <= n;++ i)
		io::read (x[i]), io::read (y[i]), z[i] = 0, deg[i] = 0, to[i].clear (), fw[i].clear (), deg[i] = 0, sl[i].clear (), sr[i].clear ();
	io::read (m);
	
//	int idx = 0;
	
	for (int i = 1;i <= m;++ i){
		io::read (eg[i].u), io::read (eg[i].v), io::read (eg[i].l), eg[i].tg = N + 1;
		to[eg[i].u].push_back (i), to[eg[i].v].push_back (i);
		++ deg[eg[i].u], ++ deg[eg[i].v];
		if (RD (x[eg[i].u] - x[eg[i].v], y[eg[i].u] - y[eg[i].v], 0) > RD (0, 0, eg[i].l))
			lim[i] = - 1, eg[i].tg = 0;
		else {
			lim[i] = (int) floor (sqrt (RD (0, 0, eg[i].l) - RD (x[eg[i].u] - x[eg[i].v], y[eg[i].u] - y[eg[i].v], 0)));
			while (RD (x[eg[i].u] - x[eg[i].v], y[eg[i].u] - y[eg[i].v], lim[i]) > RD (0, 0, eg[i].l))
				-- lim[i];
		}
//		if (T == 355 && min (eg[i].u, eg[i].v) == xx && max (eg[i].u, eg[i].v) == yy)
//			printf ("%lld %lld, %lld %lld, %lld, %lld\n", x[eg[i].u], y[eg[i].u], x[eg[i].v], y[eg[i].v], eg[i].l, lim[i]), idx = i;
		ie[i] = i;
	}
	queue < int > Q;
	for (int i = 1;i <= n;++ i)
		if (deg[i] <= 6)
			Q.push (i);
//	if (T == 355)
//		printf ("%lld\n", idx);
	while (! Q.empty ()){
		int u = Q.front (), v;
		Q.pop ();
		deg[u] = 0;
		for (int e : to[u]){
			v = eg[e].u;
			if (eg[e].u == u)
				v = eg[e].v;
			if (deg[v] > 0){
				fw[u].push_back (make_pair (v, e));
//				if (T == 355 && u == xx)
//					printf ("(%lld %lld)\n", u, v);
				-- deg[v];
				if (deg[v] == 6)
					Q.push (v);
			}
		}
	}
	for (int i = 1, j, r;i <= n;++ i){
		for (auto e : fw[i]){
			tie (j, r) = e;
			sl[j].insert (make_pair (- lim[r], r));
			sr[j].insert (make_pair (lim[r], r));
		}
	}
	io::read (t);
//	int Tg = T;
	for (int T = 1, u, v, i, h, nl, nr;T <= t;++ T){
		io::read (u), io::read (h);
		for (auto e : fw[u]){
			tie (v, i) = e;
			nl = z[u] - lim[i];
			nr = z[u] + lim[i];
			if (sl[v].find (make_pair (nl, i)) != sl[v].end ()){
				sl[v].erase (make_pair (nl, i));
				sr[v].erase (make_pair (nr, i));
				if (z[v] < nl + h || z[v] > nr + h)
					eg[i].tg = T;
				else
					sl[v].insert (make_pair (nl + h, i)),
					sr[v].insert (make_pair (nr + h, i));
			}
		}
		z[u] += h;
//		if (T == 855 && Tg == 355)
//			printf ("%lld %lld\n", u, z[u]);
//		if (abs (z[xx] - z[yy]) > lim[idx] && Tg == 355)
//			printf (">> %lld %lld(%lld %lld)\n", z[xx], z[yy], u, h);
		pair < int , int > it;
		while (! sl[u].empty () && (it = *(-- sl[u].end ())).first > z[u]){
			eg[it.second].tg = T;
			sr[u].erase (make_pair (it.first + 2ll * lim[it.second], it.second));
			sl[u].erase (it);
		}
		while (! sr[u].empty () && (it = *(sr[u].begin ())).first < z[u]){
			eg[it.second].tg = T;
			sl[u].erase (make_pair (it.first - 2ll * lim[it.second], it.second));
			sr[u].erase (it);
		}
	}
	sort (ie + 1, ie + m + 1, [] (const int &i, const int &j){
		return eg[i].tg > eg[j].tg;
	});
	tot = 0;
	for (int i = 1;i <= n;++ i)
		firs[i] = 0, fa[i] = i, dep[i] = 0;
	for (int i = 1, e, u, v;i <= m;++ i){
		e = ie[i];
		u = eg[e].u, v = eg[e].v;
		if (find (u) != find (v)){
			Add (u, v, eg[e].tg);
			Add (v, u, eg[e].tg);
			fa[fa[u]] = fa[v];
		}
	}
	for (int i = 1;i <= n;++ i)
		if (dep[i] == 0)
			init (i, 0);
	io::read (q);
	while (q --){
//		++ TT;
		int u = io::read (), v = io::read (), lca = LCA (u, v);
//		if (TT != 8843)
//			continue;
//		printf ("<%lld>", lca);
		if (! lca)
			io::write (0), putchar ('\n');
		else {
			int res = t + 1;
//			int U = u, V = v;
			for (int i = 19;i >= 0;-- i){
				if (dep[gf[u][i]] >= dep[lca]){
					res = min (res, gg[u][i]);
					u = gf[u][i];
				}
				if (dep[gf[v][i]] >= dep[lca]){
					res = min (res, gg[v][i]);
					v = gf[v][i];
				}
			}
//			printf (">>>%lld %lld %lld %lld\n", U, V, lca, T);
//			while (U != lca){
//				printf ("<%lld %lld %lld>", U, gf[U][0], gg[U][0]);
//				U = gf[U][0];
//			}
//			puts ("");
//			while (V != lca){
//				printf ("<%lld %lld %lld>", V, gf[V][0], gg[V][0]);
//				V = gf[V][0];
//			}
			io::write (res > t ? - 1 : res), putchar ('\n');
		}
	}
}

signed main (){
//	bool tag = false;
	for (T = io::read ();T --;){
//		if (! tag){
//			io::read (x);
//			while (x --)
//				io::read (y), io::read (y);
//			io::read (x);
//			while (x --)
//				io::read (y), io::read (y), io::read (y);
//			io::read (x);
//			while (x --)
//				io::read (y), io::read (y);
//			io::read (x);
//			while (x --)
//				io::read (y), io::read (y);
//			tag = true;
//		} else
		ARKNIGHTS ();
	}
	return 0;
}