#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    vector<long long> A(n), B(n);
    for (auto& a : A) cin >> a;
    for (auto& b : B) cin >> b;
    vector<long long> combined;
    long long sa = accumulate((A).begin(), (A).end(), 0ll),
              sb = accumulate((B).begin(), (B).end(), 0ll);
    if (sa > sb) {
      cout << "NO\n";
      continue;
    }
    long long lmax = 0ll;
    long long lsum = 0;
    long long rsum = B.back();
    bool ok = true;
    for (int i = 0; i < 2 * n; ++i) {
      rsum += -A[i % n] + B[i % n];
      lsum += -A[i % n] + B[(i + n - 1) % n];
      lmax = max(lmax, lsum);
      if (rsum < lmax) {
        ok = false;
        break;
      }
    }
    if (ok)
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return 0;
}
