#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1010;
struct point {
    int x, y;
    int c;
    point() {}
    point(int _x, int _y) : x(_x), y(_y), c{} {}
    point operator-(const point &k) const { return point(x - k.x, y - k.y); }
} a[N];
int cross(point k1, point k2) { return abs(k1.x * k2.y - k1.y * k2.x); }
int calc(point a1, point a2, point b1, point b2) {
    return cross(b1 - a1, b2 - a1) + cross(b2 - a1, a2 - a1);
}
int calc(point a1, point a2, point b) { return cross(a1 - b, a2 - b); }
void solve() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i].c;
    for (int i = 1; i <= n; i++) cin >> a[i].x >> a[i].y;
//    vector<int> v;
//    for (int i = 1; i <= n; i++) v.push_back(a[i].c);
//    sort(v.begin(), v.end());
//    v.erase(unique(v.begin(), v.end()), v.end());
//    for (int i = 1; i <= n; i++) a[i].c = lower_bound(v.begin(), v.end(), a[i].c) - v.begin();
    for (int i = 1; i <= n; i++) a[i + n] = a[i];
    vector<vector<int>> dp(n * 2 + 1, vector<int>(n * 2 + 1));
    for (int len = 1; len <= n; len++)
        for (int l = 1; l <= n; l++) {
            int r = l + len - 1;
            if (a[l].c != a[r].c) continue;
//            vector<int> col;
//            vector<vector<int>> pos(v.size() + 1);
            for (int k = l + 1; k < r; k++) {
                int c = a[k].c;
//                if (pos[c].size() == 0) col.push_back(c);
//                pos[c].push_back(k);
                dp[l][r] = max(dp[l][r], calc(a[l], a[r], a[k]));
            }
            for(int i = l + 1; i < r; i++)
            	for(int j = i + 1; j < r; j++) {
            		if(a[i].c != a[j].c) continue;
            		dp[l][r] = max(dp[l][r], dp[i][j] + calc(a[l], a[r], a[i], a[j]));
				}
//            for (auto c : col) {
//                if (pos[c].size() == 1) continue;
//                for (int i = 1; i < pos[c].size(); i++)
//                    dp[l][r] = max(dp[l][r], dp[pos[c].front()][pos[c][i]] +
//                                                 calc(a[l], a[r], a[pos[c].front()], a[pos[c][i]]));
//                for (int i = 0; i < pos[c].size() - 1; i++)
//                    dp[l][r] = max(dp[l][r], dp[pos[c][i]][pos[c].back()] +
//                                                 calc(a[l], a[r], a[pos[c][i]], a[pos[c].back()]));
//            }
	
        }
    int ans = 0;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= 2 * n; j++) ans = max(ans, dp[i][j]);
    cout << ans << '\n';
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T;
    cin >> T;
    while (T--) solve();
}