#include <cmath>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <queue>
#include <cassert>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <bitset>
#include <sstream>
#include <chrono>
#include <cstring>

using namespace std;

typedef long long ll;

ll gcd(ll a, ll b){
    while(a > 0 && b > 0){
        if(a >= b)
            a %= b;
        else
            b %= a;
    }
    return a + b;
}

ll lcm(ll a, ll b) {
    return a * b / gcd(a, b);
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int tt;
    cin >> tt;
    while(tt--){
        int n;
        cin >> n;
        vector<ll> a(n);
        ll summ = 0;
        for(int i = 0; i < n; ++i){
            cin >> a[i];
            summ += a[i];
        }
        ll ans1 = a[0];
        ll sum = 0;
        ll min_sum = 0;
        for (int r = 0; r < n - 1; ++r) {
            sum += a[r];
            ans1 = max (ans1, sum - min_sum);
            min_sum = min (min_sum, sum);
        }
        ll ans2 = a[0];
        sum = 0;
        min_sum = 0;
        for (int r = 0; r < n - 1; ++r) {
            sum += a[r];
            ans2 = max (ans2, sum - min_sum);
            min_sum = min (min_sum, sum);
        }
        if(summ > max(ans1, ans2)){
            cout << "YES" << endl;
        }
        else{
            cout << "NO" << endl;
        }
    }
}