#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b) {
  long long res = 1;
  a = a % 1000000007;
  while (b > 0) {
    if (b & 1) {
      res = (res * a) % 1000000007;
      b--;
    }
    a = (a * a) % 1000000007;
    b >>= 1;
  }
  return res;
}
long long fermat_inv(long long y) { return power(y, 1000000007 - 2); }
long long gcd(long long a, long long b) { return (b == 0) ? a : gcd(b, a % b); }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 1;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    long long a[n];
    long long b[n];
    long long c[n], d[n];
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      c[i] = 0;
    }
    for (int i = 0; i < n; i++) {
      cin >> b[i];
      d[i] = b[i];
    }
    int check = 1;
    c[0] = min(d[n - 1], a[0]);
    d[n - 1] -= c[0];
    long long p[n];
    p[0] = c[0];
    for (int i = 0; i < n - 1; i++) {
      if (i != 0) {
        c[i] += min(d[(n + i - 1) % n], a[i] - c[i]);
        d[(n + i - 1) % n] -= c[i];
        p[i] = c[i];
      }
      long long v1 = min(d[i], a[i] - c[i]);
      d[i] -= v1;
      c[i] += v1;
      if (c[i] < a[i]) {
        check = 0;
        break;
      }
    }
    if (check == 0) {
      cout << "NO\n";
    } else {
      long long val = 0ll;
      for (int i = n - 3; i >= 0; i--) {
        if (d[i] > 0) {
          val = min(d[i], min(b[(n + i - 1) % n] - d[(n + i - 1) % n], p[i]));
          d[(n + i - 1) % n] += val;
        }
      }
      if (d[n - 2] + d[n - 1] >= a[n - 1])
        cout << "YES\n";
      else
        cout << "NO\n";
    }
  }
  return 0;
}
