//Linkwish's code
#include<bits/stdc++.h>
#define endl '\n'
#define si inline
#define fi first
#define se second
using namespace std;
typedef long long ll;typedef __int128 li;
typedef pair<int,int> pii;typedef pair<ll,ll> pll;
typedef const int ci;typedef const ll cl;ci iinf=INT_MAX;cl linf=1e18;
template<typename T>si bool gmax(T &x,const T y){if(x<y)return x=y,1;return 0;}
template<typename T>si bool gmin(T &x,const T y){if(y<x)return x=y,1;return 0;}

namespace LinkWish{
	
	ci N=505;

	int n,v[N];

	struct point{
		ll x,y;
	//	inline void print(){printf("(%.3lf,%.3lf)\n",x,y);}
		point operator +(const point &t)const{return (point){x+t.x,y+t.y};}
		point operator -(const point &t)const{return (point){x-t.x,y-t.y};}
		point operator *(const ll &t)const{return (point){x*t,y*t};}
		point operator /(const ll &t)const{return (point){x/t,y/t};}
		ll operator |(const point &t)const{return x*t.x+y*t.y;}
		ll operator &(const point &t)const{return x*t.y-y*t.x;}
	};
	inline ll dis(point x,point y){return (x.x-y.x)*(x.x-y.x)+(x.y-y.y)*(x.y-y.y);}
	struct line{
		point x,y;
		inline line(){}
		inline line(point xx,point yy){x=xx,y=yy;}
		inline ll len(){return dis(x,y);}
	};
	si ll S(point x,point y,point z){
		if(x.x>y.x)swap(x,y);
		if(y.x>z.x)swap(y,z);
		if(x.x>y.x)swap(x,y);
		return abs((y.x-x.x)*(z.y-x.y)-(z.x-x.x)*(y.y-x.y));
	}

	ll f[N][N][3];
	point a[N];

	si void solve(){
		cin>>n;
		for(int i=0;i<n;i++)cin>>v[i];
		for(int i=0;i<n;i++)cin>>a[i].x>>a[i].y;

		for(int i=0;i<n;i++)
			for(int j=0;j<n;j++)
				f[i][j][0]=f[i][j][1]=f[i][j][2]=-linf;

		for(int i=1;i<=n;i++)f[i][i][0]=f[i][i][1]=f[i][i][2]=0;

		ll ans=0;
		for(int len=2;len<=n;len++){
			for(int i=0,j=len-1;i<n;i++,j++){
				if(j>=n)j-=n;
				for(int c=0;c<len;c++){
					int k=(i+c)%n;
					ll s=S(a[i],a[k],a[j]);
					if(k!=i){
						gmax(f[i][j][1],f[k][j][0]+s);
						if(v[i]==v[j])gmax(f[i][j][0],f[k][j][2]+s);
					}
					if(k!=j){
						gmax(f[i][j][2],f[i][k][0]+s);
						if(v[i]==v[j])gmax(f[i][j][0],f[i][k][1]+s);
					}
				}
				gmax(ans,f[i][j][0]);
			}
		}

		cout<<ans<<endl;
	}
	si void mian(){
		int TT;cin>>TT;while(TT--)solve();
	}
}

signed main(){
	#ifndef ONLINE_JUDGE
	assert(freopen("in.in","r",stdin));
	// assert(freopen("out.out","w",stdout));
	assert(freopen("out.err","w",stderr));
	#endif
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);   
	LinkWish::mian();
	return 0;
}