#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
template <class T>
bool ckmin(T& a, const T& b) {
  return b < a ? a = b, 1 : 0;
}
template <class T>
bool ckmax(T& a, const T& b) {
  return a < b ? a = b, 1 : 0;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1000000007;
const char nl = '\n';
const int MX = 100001;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int T;
  cin >> T;
  while (T--) {
    int N;
    cin >> N;
    int A[N], B[N];
    for (int i = 0; i < (N); i++) cin >> A[i];
    for (int i = 0; i < (N); i++) cin >> B[i];
    int S = 0;
    int last = B[0];
    for (int i = 1; i < (4 * N + 5); i++) {
      int cur = B[(i + N - 1) % N] - last;
      last = A[i % N] - cur;
      ckmax(last, 0);
      if (last > B[i % N]) {
        S = i;
        last = B[i % N];
      }
    }
    if (S < 2 * N) {
      cout << "YES" << nl;
    } else {
      cout << "NO" << nl;
    }
  }
  return 0;
}
