#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+7,inf=4e18,mod=998244353;
vector<array<int,2>> p;
int S(array<int,2> a,array<int,2> b)
{
	return abs(a[0]*b[1]-a[1]*b[0]);
}
struct seg
{
	int l,r,area;
	seg()
	{
		l=r=0;
		area=-inf;
	}
	seg(int a,int b,int c):l(a),r(b),area(c)
	{
	}
	~seg()
	{
		l=r=area=0;
	}
};
seg max(seg a,seg b)
{
	return a.area>b.area?a:b;
}
array<int,2> operator - (array<int,2> a,array<int,2> b)
{
	return {a[0]-b[0],a[1]-b[1]};
}
vector<vector<seg>> dp;
seg merge(seg a,int l,int r)
{
	array<int,2> x=p[l]-p[a.l],y=p[r]-p[a.l];
	array<int,2> z=p[a.r]-p[a.l];
	return seg(l,r,a.area+S(z,y)+S(y,x));
}
void O_o()
{
	int n;
	cin>>n;
	dp=vector<vector<seg>> (2*n+1,vector<seg>(2*n+1));
	vector<int> a(n+1);
	for(int i=1; i<=n; i++)
	{
		cin>>a[i];
		a.push_back(a[i]);
	}
	p.assign(n+1,{0,0});
	for(int i=1; i<=n; i++)
	{
		cin>>p[i][0]>>p[i][1];
		p.push_back(p[i]);
	}
	for(int i=1; i<=2*n; i++)
	{
		dp[i][i]=seg(i,i,0);
		if(i<2*n&&a[i]==a[i+1])
			dp[i][i+1]=seg(i,i+1,0);
	}
	for(int len=3; len<=n; len++)
	{
		for(int l=1; l<=2*n-len+1; l++)
		{
			int r=l+len-1;
			dp[l][r]=max(dp[l][r-1],dp[l+1][r]);
			dp[l][r]=max(dp[l+1][r-1],dp[l][r]);
			if(a[l]==a[r])
			{
				//fix l+1
				for(int k=l+1; k<=r-1; k++)
				{
					dp[l][r]=max(dp[l][r],merge(dp[l+1][k],l,r));
					dp[l][r]=max(dp[l][r],merge(dp[k][r-1],l,r));
				}
			}
		}
	}
	seg ans=seg();
	ans.area=0;
	for(int i=1; i<=n; i++)
		ans=max(ans,dp[i][i+n-1]);
	cout<<ans.area<<"\n";
}
signed main()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cout<<fixed<<setprecision(12);
	int T=1;
	cin>>T;
	while(T--)
	{
		O_o();
	}
}