#include<bits/stdc++.h>
using namespace std;
int t,n,a[100005],ans[100005];
bool f(int l,int r,int k){
	if(l>r)return false;
	int mid=(l+r)/2;
	if(ans[mid]==k)return true;
	else if(ans[mid]<k)return f(mid+1,r,k);
	else  return f(l,mid-1,k);
}
int main(){
	cin>>t;
	while(t--){
		cin>>n;
		for(int i=1;i<=n;i++){
			cin>>a[i];
			if(i==1)ans[i]=a[i];
			else ans[i]=ans[i-1]+a[i];
		}
		if(ans[n]%2!=0)cout<<"No\n";
		else{
			if(f(1,n,a[n]/2))cout<<"Yes\n";
			else cout<<"No\n";
		}
	}
    return 0;
}