#include <bits/stdc++.h>
using namespace std;
int a[100001];
long long s[100001];

int main()
{
	int t, n;
	bool flag;
	scanf("%d", &t);

	while (t--)
	{
		flag = false;
		scanf("%d", &n);
		s[0] = 0;
		for (int i = 1; i <= n; i++)
		{
			scanf("%d", a + i);
			s[i] = s[i - 1] + a[i];
		}

		for (int i = 1; i < n; i++)
		{
			long long left = s[i] - s[0]; //s[1,i]
			long long right = s[n] - s[i];//s[i+1,n]

			if (left == right)
			{
				flag = true;
				break;
			}
		}
		if (flag)
			printf("Yes\n");
		else
			printf("No\n");
	}
	return 0;
}