#include <bits/stdc++.h>

struct Point {
    int x, y;
};

long long det(Point a, Point b, Point c) {
    return (long long)a.x * b.y +
           (long long)b.x * c.y +
           (long long)c.x * a.y -
           (long long)a.x * c.y -
           (long long)b.x * a.y -
           (long long)c.x * b.y;
}

void solve_test() {
    int n;
    std::cin >> n;

    std::vector<int> f(n);

    for (int i = 0; i < n; i++)
        std::cin >> f[i];

    std::vector<Point> p(n);

    for (int i = 0; i < n; i++)
        std::cin >> p[i].x >> p[i].y;

    std::vector<std::vector<long long>> dp(n, std::vector<long long>(n, (1LL << 63)));
    std::vector<std::vector<int>> paired(n, std::vector<int>(n));

    std::cerr << (1LL << 63) << "\n";

    for (int i = 0; i < n; i++) {
        dp[i][i] = 0;
        paired[i][i] = i;

        int ii = (i + 1) % n;
        if (f[i] == f[ii]) {
            dp[i][ii] = 0;
            paired[i][ii] = i;
        }
    }

    long long res = 0LL;

    for (int len = 3; len <= n; len++) {
        for (int i = 0; i < n; i++) {
            int j = (i + len - 1) % n;

            int ii = (i + 1) % n;
            int jj = (j - 1 + n) % n;

            if (f[i] == f[j]) {
                for (int dk = 1; dk < len - 1; dk++) {
                    int k = (i + dk) % n;

                    long long new_area = dp[ii][k];
                    int pp = paired[ii][k];
                    
                    new_area += std::abs(det(p[i], p[pp], p[k])) + std::abs(det(p[i], p[k], p[j]));

                    if (new_area > dp[i][j]) {
                        dp[i][j] = new_area;
                        paired[i][j] = i;
                    }
                }
            }

            if (dp[ii][j] > dp[i][j]) {
                dp[i][j] = dp[ii][j];
                paired[i][j] = paired[ii][j];
            }
        
            if (dp[i][j] > res)
                res = dp[i][j];
        }
    }

    std::cout << res << "\n";
}

int main() {
    int t;
    std::cin >> t;

    while (t--) solve_test();

    return 0;
}