#include <bits/stdc++.h>
using namespace std;
template <class c>
struct rge {
  c b, e;
};
template <class c>
rge<c> range(c i, c j) {
  return rge<c>{i, j};
}
template <class c>
auto dud(c* x) -> decltype(cerr << *x, 0);
template <class c>
char dud(...);
struct debug {
  template <class c>
  debug& operator<<(const c&) {
    return *this;
  }
};
int main() {
  ios_base::sync_with_stdio(0);
  int T;
  cin >> T;
  for (int i = 1; i <= T; i++) {
    int n;
    cin >> n;
    int cities[n];
    int powers[n];
    for (int ii = 0; ii < n; ii++) {
      cin >> cities[ii];
    }
    for (int ii = 0; ii < n; ii++) {
      cin >> powers[ii];
    }
    bool ok = false;
    int min = 0;
    int max = powers[0];
    int check = 0;
    while (min <= max) {
      int mid = (min + max) / 2;
      int next = std::max(0, cities[1] - mid);
      int rest = powers[0] - mid;
      bool circ = true;
      for (int ii = 1; ii < n; ii++) {
        int can = powers[ii] - next;
        if (can < 0) {
          circ = false;
          break;
        }
        next = std::max(0, cities[(ii + 1) % n] - can);
        check++;
      }
      if (circ) {
        if (next <= rest) {
          ok = true;
          break;
        }
        if (max - min == 1) {
          break;
        }
        max = mid - 1;
      } else {
        min = mid + 1;
      }
    }
    if (ok) {
      cout << "YES" << endl;
    } else {
      cout << "NO" << endl;
    }
  }
}
