#include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=1.5e6+10;
const int INF=0x3f3f3f3f;
int t,n,m,K,q,X[maxn],Y[maxn],sid,times[maxn],dp[maxn][20];
int in[maxn],vis[maxn],H[maxn],fa[maxn],dep[maxn];
vector<pair<int,int>>G[maxn],Fa[maxn];
set<pair<int,int> >L[maxn],R[maxn];
set<pair<int,int> >S;
map<pair<int,int>,int>mp;
vector<int>g[maxn];//Kruskal 
struct node{
	int k,x,y;
}sta[maxn];
int tot;
void init(){
	for(int i=1;i<=n;i++){
		L[i].clear(),R[i].clear(),G[i].clear(),Fa[i].clear();
		in[i]=vis[i]=H[i]=0;
	}
	for(int i=1;i<=2*n;i++){
		g[i].clear();fa[i]=i,dep[i]=0;times[i]=0;
	}
	S.clear();mp.clear();tot=0;
}
int P(int x){
	int y=sqrt(x);
	while(y*y>x)y--;
	while((y+1)*(y+1)<=x)y++;
	return y;
}
int solve(int x,int y,int w){
	int val=w*w-(X[x]-X[y])*(X[x]-X[y])-(Y[x]-Y[y])*(Y[x]-Y[y]);
	return P(val);
}
int find(int x){
	return fa[x]==x?x:fa[x]=find(fa[x]);
}
void work(int v,int x,int y){
	int l=find(x),r=find(y);
	if(l==r)return ;
	sid++,times[sid]=v;
	fa[l]=fa[r]=sid;
	g[sid].push_back(l),g[sid].push_back(r);
}
void dfs(int x,int f){
	dep[x]=dep[f]+1;
	dp[x][0]=f;
//	cout<<x<<" "<<f<<" "<<dep[x]<<" "<<dp[x][0]<<endl;
	for(auto p:g[x]){
		if(p==f)continue;
		dfs(p,x);
	}
}
int LCA(int x,int y){
	if(dep[x]<dep[y])swap(x,y);
	for(int i=19;i>=0;i--)if(dep[dp[x][i]]>=dep[y])x=dp[x][i];
	if(x==y)return x;
	for(int i=19;i>=0;i--)if(dp[x][i]!=dp[y][i])x=dp[x][i],y=dp[y][i];
	return dp[x][0];
}
signed main(){
	std::ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	cin>>t;
	while(t--){
		cin>>n;
		for(int i=1;i<=n;i++)cin>>X[i]>>Y[i];
		init();
		cin>>m;
		for(int i=1;i<=m;i++){
			int x,y,val;cin>>x>>y>>val;
			G[x].push_back({y,val});
			G[y].push_back({x,val});
			in[x]++,in[y]++;
		}
		for(int i=1;i<=n;i++)S.insert({in[i],i});
		//定向
		for(int i=1;i<=n;i++){
			auto it=S.begin();
			int x=it->second;
			S.erase(it),vis[x]=1;
			for(auto p:G[x]){
				int y=p.first,w=p.second;
				if(vis[y])continue;
				Fa[x].push_back(p);
				L[y].insert({-solve(x,y,w),x});
				R[y].insert({solve(x,y,w),x});
				S.erase({in[y],y});
				in[y]--;
				S.insert({in[y],y});
			}
		}
		cin>>K;
		for(int i=1;i<=K;i++){
			int x,val;cin>>x>>val;
			H[x]+=val;
			//将父亲处理
			for(auto p:Fa[x]){
				int v=p.first,w=p.second;
				if(mp[{x,v}])continue;
				L[v].erase({H[x]-val-solve(x,v,w),x});
				R[v].erase({H[x]-val+solve(x,v,w),x});
				int pos=(X[x]-X[v])*(X[x]-X[v])+(Y[x]-Y[v])*(Y[x]-Y[v])+(H[x]-H[v])*(H[x]-H[v]);
				if(pos>w*w){
					sta[++tot]={i,x,v};
					mp[{x,v}]=mp[{v,x}]=1;
					continue;
				}
				L[v].insert({H[x]-solve(x,v,w),x});
				R[v].insert({H[x]+solve(x,v,w),x});
			}
			
			while(L[x].size()&&((--L[x].end())->first)>H[x]){//超出下界 
				auto it=(--L[x].end());
				if(mp[{x,it->second}]){
					L[x].erase(it);
					continue;
				}
				sta[++tot]={i,x,it->second};
				mp[{x,it->second}]=mp[{it->second,x}]=1;
				L[x].erase(it);
			}
			
			while(R[x].size()&&((R[x].begin())->first)<H[x]){//小于上界 
				auto it=R[x].begin();
				if(mp[{x,it->second}]){
					R[x].erase(it);
					continue;
				}
				sta[++tot]={i,x,it->second};
				mp[{x,it->second}]=mp[{it->second,x}]=1;
				R[x].erase(it);
			}
		}
		
		sid=n;
//		cout<<tot<<endl;
		for(int i=1;i<=n;i++){
			for(auto p:G[i]){
				if(mp[{i,p.first}])continue;
				//未被删除
				work(K+1,i,p.first); 
			}
		}
		for(int i=tot;i>=1;i--){//本质是求最小值最大 
			work(sta[i].k,sta[i].x,sta[i].y);
		}
		for(int i=1;i<=n;i++){
			int x=find(i);
			if(!dep[x])dfs(x,0);//所有连通块 
		}
		for(int i=1;i<=19;i++){
			for(int j=1;j<=sid;j++){
				dp[j][i]=dp[dp[j][i-1]][i-1];
			}
		}
		cin>>q;
		for(int i=1;i<=q;i++){
			int x,y;cin>>x>>y;
			int lca=LCA(x,y);
			if(times[lca]>K)cout<<-1<<"\n";
			else cout<<times[lca]<<"\n";
		}
	}
	return 0;
}
//1
//4
//0 0
//0 12
//0 24
//0 25
//3
//1 2 13
//2 3 13
//3 4 1
//4
//3 1
//2 6
//3 1
//2 -6
//4
//1 2
//2 3
//3 4
//1 4