#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<string>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
int main(){
	static int t,n,a[200000];
	cin>>t;
	while(cin>>n){
		for(int i=0;i<n;i++)
			cin>>a[i];
		ll sum=accumulate(a,a+n,0ll);
		bool f=sum%3==0;
		for(int i=0;i<n;i++)
			if(a[i]>sum/3)
				f=0;
		cout<<(f?"Yes":"No")<<endl;
	}
}