#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

void solve(){

    ll N, S=0, A, mx=0;
    cin >> N;
    for (int i=0; i<N; i++){
        cin >> A;
        mx = max(mx, A);
        S += A;
    }

    if (S % 3 != 0){
        cout << "No" << endl;
        return;
    }
    
    cout << (mx <= S / 3 ? "Yes" : "No") << endl;

}

int main(){

    int T;
    cin >> T;

    while(T){
        solve();
        T--;
    }

    return 0;
}