#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];

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

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

int lf[N], rf[N];
ll dfs(int l, int r) {
    if(dp[l][r] != -1) return dp[l][r];
    ll dplr = 0;
    for(int i = l + 1; i < r; i++) {
        rf[f[i]] = i;
    }
    for (int i = r - 1; i > l; i--) {
        lf[f[i]] = i;
    }
    for (int i = l + 1; i < r; i++) {
        int nl = i, nr = rf[f[i]];
        if(i != rf[f[i]])
            dplr = max(dplr, dfs(nl, nr) + std::abs((p[nl] - p[l]) * (p[nr] - p[l])) + std::abs((p[l] - p[r]) * (p[nr] - p[r])));
        nl = lf[f[i]], nr = i;
        if(i != lf[f[i]])
            dplr = max(dplr, dfs(nl, nr) + std::abs((p[nl] - p[l]) * (p[nr] - p[l])) + std::abs((p[l] - p[r]) * (p[nr] - p[r])));
                
        dplr = max(dplr, std::abs((p[l] - p[i]) * (p[r] - p[i])));
        // if(nl == nr) {
        //     dp[l][r] = max(dp[l][r], std::abs((p[l] - p[nl]) * (p[r] - p[nr])));
        // } else {
        //     dp[l][r] = max(dp[l][r], dfs(nl, nr) + std::abs((p[nl] - p[l]) * (p[nr] - p[l])) + std::abs((p[l] - p[r]) * (p[nr] - p[r])));
        // }
    }
    dp[l][r] = dplr;
    ans = max(ans, dp[l][r]);
    return dp[l][r];
}

void solve() {
    cin >> n;

    ans = 0;
    for(int i = 1; i <= n + n; i++) {
        dp[i][i] = 0;
        for(int j = i + 1; j <= n + n; j++)
            dp[i][j] = -1;
    }
    vector<int> vec;
    for(int i = 1; i <= n; i++) {
        cin >> f[i];
        vec.push_back(f[i]);
        f[i + n] = f[i];
    }
    sort(vec.begin(), vec.end());
    vec.erase(unique(vec.begin(), vec.end()), vec.end());
    for(int i = 1; i <= n + n; i++) {
        f[i] = lower_bound(vec.begin(), vec.end(), f[i]) - vec.begin();
    }

    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 << '\n';
}

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