#include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define dbg(x) cout<<#x"="<<x<<' '

using namespace std;
typedef long long ll;

const int N = 500 + 5;
int n, f[N * 2];
ll dp[N * 2][N * 2], ans;
struct Point {
    ll x, y;
};
Point p[N * 2];

Point operator-(Point u, Point v) {
    return Point({u.x - v.x, u.y - v.y});
}

ll operator*(Point u, Point v) {
    return u.y * v.x - u.x * v.y;
}

ll dfs(int l, int r) {
    if(dp[l][r] != -1) return dp[l][r];
    dp[l][r] = 0;
    unordered_map<int, int> mp1, mp2;
    for(int i = r - 1; i > l; i--) {
        mp1[f[i]] = i;
    }
    for(int i = l + 1; i < r; i++) {
        mp2[f[i]] = i;
    }
    for(auto [v, nl] : mp1) {
        int nr = mp2[v];
        if(nl == nr) {
            dp[l][r] = max(dp[l][r], dfs(nl, nr) + abs((p[l] - p[nl]) * (p[r] - p[nr])));
        } else {
            dp[l][r] = max(dp[l][r], dfs(nl, nr) + abs((p[nl] - p[l]) * (p[nr] - p[l])) + abs((p[l] - p[r]) * (p[nr] - p[r])));
        }
    }
    ans = max(ans, dp[l][r]);
    return dp[l][r];
}

void solve() {
    cin >> n;

    ans = 0;
    for(int i = 1; i <= n; i++) {
        dp[i][i] = 0;
        for(int j = i + 1; j <= n + n; j++)
            dp[i][j] = -1;
    }

    for(int i = 1; i <= n; i++) {
        cin >> f[i];
        f[i + n] = f[i];
    }
    for(int i = 1; i <= n; i++) {
        cin >> p[i].x >> p[i].y;
        p[i + n] = p[i];
    }
    for(int i = 1; i <= n; i++) {
        for(int j = i + n - 1; j > i; j--) {
            if(f[i] == f[j])
                dfs(i, j);
        }
    }
    cout << ans << endl;
}

int main() {
    fastio;
    int T = 1;
    cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}