#include <iostream>
#include <vector>
#include <algorithm>


using namespace std;

typedef long long ll;

int main()
{
    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[1];
        sum = 0;
        min_sum = 0;
        for (int r = 1; r < n; ++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;
        }
    }
}