#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 3;
long long int a[maxn];
long long int b[maxn];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
      cin >> a[i];
    }
    for (int i = 0; i < n; ++i) {
      cin >> b[i];
    }
    long long int prev[n], cur[n];
    for (int i = 0; i < n; i++) {
      prev[i] = b[(i - 1 + n) % n];
      cur[i] = 0;
    }
    for (int i = 2 * n + 1; i >= 0; i--) {
      if ((prev[i % n] + cur[i % n]) > a[i % n]) {
        long long int temp =
            min((prev[i % n] + cur[i % n]) - a[i % n], prev[i % n]);
        prev[i % n] -= temp;
        cur[(i - 1 + n) % n] += temp;
      }
    }
    int p = 1;
    for (int i = 0; i < n; i++) {
      if ((cur[i] + prev[i]) < a[i]) p = 0;
    }
    if (p)
      cout << "YES"
           << "\n";
    else
      cout << "NO"
           << "\n";
  }
}
