#include<bits/stdc++.h>
#define endl '\n'
#define int long long
#define double long double
#define Vector Point
#define Mirai ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
using namespace std;
typedef pair<int,int> pii;
const double eps=1e-12;
struct Point
{
    int x,y;
    Point(int x=0,int y=0):x(x),y(y){};
    Vector operator-(const Vector &o)const{return Vector(x-o.x,y-o.y);}
};
int Cross(Vector a,Vector b){return abs(a.x*b.y-a.y*b.x);}
void show(Point a){cout<<a.x<<" "<<a.y<<endl;}
void solve()
{
    int n;cin>>n;
    vector<int> val(n*2+1);
    vector<Point> p(n*2+1);
    for(int i=1;i<=n;i++)
    {
        cin>>val[i];
        val[i+n]=val[i];
    }
    for(int i=1;i<=n;i++)
    {
        cin>>p[i].x>>p[i].y;
        p[i+n]=p[i];
    }
    vector<vector<int>> L(n*2+1,vector<int>(n*2+1));
    vector<vector<int>> R(n*2+1,vector<int>(n*2+1));
    
    for(int i=1;i<=n*2;i++)
    {
        int pos=i;
        for(int j=i;j<=n*2;j++)
        {
            if(val[i]==val[j])pos=j;
            L[i][j]=pos;
        }
    }

    for(int j=n*2;j>=1;j--)
    {
        int pos=j;
        for(int i=j;i>=1;i--)
        {
            if(val[i]==val[j])pos=i;
            R[i][j]=pos;
        }
    }

    vector<vector<int>> dp(n*2+1,vector<int>(n*2+1,0));
    int res=0;
    for(int len=2;len<=n-1;len++)
    {
        for(int l=1;l<=n*2-len;l++)
        {
            int r=l+len;
            if(val[l]!=val[r])continue;
            for(int l1=l+1;l1<r;l1++)
            {
                int r1=L[l1][r-1];
                dp[l][r]=max(dp[l][r],dp[l1][r1]+Cross(p[l1]-p[r],p[r1]-p[r])+Cross(p[l1]-p[l],p[l1]-p[r]));
                // else dp[l][r]=max(dp[l][r],dp[l1][r1]+Cross(p[l]-p[l1],p[r]-p[l1]));
            }
            for(int r1=r-1;r1>l;r1--)
            {
                int l1=R[l+1][r1];
                dp[l][r]=max(dp[l][r],dp[l1][r1]+Cross(p[l1]-p[r],p[r1]-p[r])+Cross(p[l1]-p[l],p[l1]-p[r]));
                // else dp[l][r]=max(dp[l][r],dp[l1][r1]+Cross(p[l]-p[l1],p[r]-p[l1]));
            }
            res=max(res,dp[l][r]);
        }
    }
    cout<<res<<endl;
}
signed main()
{
    Mirai;
    int T=1;
    cin>>T;
    while(T--)
    {
        solve();
    }
    return 0;
}