#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
#define debug(x) cerr << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 3e5 + 10, mod = 998244353;
const ll INF = 4e18;

pll operator-(const pll &a, const pll &b) {
    return {a.x - b.x, a.y - b.y};
}
ll operator^(const pll &a, const pll &b) {
    return a.x * b.y - a.y * b.x;
}
ll area(const pll &a, const pll &b, const pll &c) {
    return abs((b - a) ^ (c - a));
}
__int128 sq(ll x) {
    return (__int128)x * x;
}

void solve() {
    int n; cin >> n;
    vector<int> s(n);
    vector<pll> q(n);
    for (int i = 0; i < n; ++i) cin >> s[i], s.emplace_back(s[i]);
    for (int i = 0; i < n; ++i) {
        cin >> q[i].x >> q[i].y;
        q.emplace_back(q[i]);
    }
    vector<vector<ll>> f(n * 2, vector<ll>(n * 2));
    ll ans = 0;
    for (int len = 1; len < n; ++len) {
        for (int i = 0; i + len < n * 2; ++i) {
            int j = i + len;
            if (s[i] != s[j]) continue;
            for (int k = i + 1; k < j; ++k) {
                f[i][j] = max(f[i][j], area(q[i], q[j], q[k]));
            }
            int x = i + 1, y = j - 1;
            while (x <= y) {
                if (s[x] != s[y]) --y;
                else {
                    f[i][j] = max(f[i][j], f[x][y] + area(q[i], q[j], q[y]) + area(q[x], q[y], q[i]));
                    ++x, --y;
                }
            }
            x = i + 1, y = j - 1;
            while (x <= y) {
                if (s[x] != s[y]) ++x;
                else {
                    f[i][j] = max(f[i][j], f[x][y] + area(q[i], q[j], q[y]) + area(q[x], q[y], q[i]));
                    ++x, --y;
                }
            }
            // cerr << i << ' ' >> j << el;
            // debug(f[i][j]);
            ans = max(ans, f[i][j]);
        }
    }
    cout << ans << el;
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int tcase = 1;
    cin >> tcase;
    while (tcase--) solve();
}