#include <bits/stdc++.h>
using namespace std;
void te() {
	int n;
	scanf("%d", &n);
	vector<int> x(n), y(n);
	for(int i = 0; i < n; ++i)
		scanf("%d%d", &x[i], &y[i]);
	
	const int MAX = 2.5e6;
	const long long INF = 1e18;
	vector<long long> dp(MAX, INF);
	dp[0] = 0;
	
	int m;
	scanf("%d", &m);
	while(m--) {
		int w, cost;
		scanf("%d%d", &w, &cost);
		for(int i = w; i < MAX; ++i)
			dp[i] = min(dp[i], dp[i-w] + cost);
	}
	for(int i = MAX - 2; i >= 0; --i)
		dp[i] = min(dp[i], dp[i+1]);
	
	long long ans = 0;
	for(int i = 0; i < n; ++i) {
		int j = (i + 1) % n;
		int dx = x[i] - x[j], dy = y[i] - y[j];
		long long sq = (long long) dx * dx + (long long) dy * dy;
		int d = sqrt(sq - 0.5) + 1;
		ans += dp[d];
	}
	printf("%lld\n", ans);
}
int main() {
	int T;
	scanf("%d", &T);
	while(T--) te();
}