#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}

int main(){
    int t;
    cin >> t;
    rep(houren,t){
        ll n,tot=0;
        cin >> n;
        vector<ll> a(n);
        rep(i,n){
            cin >> a[i];
            tot += a[i];
        }
        if(tot%3){
            cout << "No" << endl;
            continue;
        }
        sort(all(a));
        ll tot2 = 0;
        rep(i,n-2) tot2 += a[i];
        if(tot>tot2*3) cout << "No" << endl;
        else cout << "Yes" << endl;
    }
    return 0;
}