#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;

string consistency(int n){

    int maxi1 = INT32_MIN;
    int last = 0;
    int sum = a[n-1];

    for(int i=0; i<n-1; i++){
        sum += a[i];

        int curr = max(last+a[i], a[i]);
        last = curr;

        maxi1 = max(maxi1, curr);
    }

    int maxi2 = INT32_MIN;
    last = 0;
    for(int i=1; i<n; i++){
        int curr = max(last+a[i], a[i]);
        last = curr;

        maxi2 = max(maxi2, curr);
    }

    if(sum > maxi1 && sum > maxi2) return "YES";
    return "NO";

}















string practice(int n){


    return 0;
}





void solve() {
    
    int n;
    cin>> n;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}