#include <bits/stdc++.h>
using namespace std;
const int MX = 1e6 + 5, MXX = 23;
const long long mod = 1e9 + 7, inf = 1e18 + 6;
int a[MX], b[MX], fr[MX], hlp[MX];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(9);
  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], hlp[i] = 0;
    for (int i = 1; i <= 10 * n; ++i) {
      int v = i % n;
      int nd = max(0, a[v] - hlp[(i - 1) % n]);
      fr[v] = min(b[v], nd);
      hlp[v] = b[v] - fr[v];
    }
    bool tr = true;
    for (int i = 0; i != n; ++i)
      if (fr[i] + hlp[(i ? i - 1 : n - 1)] < a[i]) {
        tr = false;
        break;
      }
    cout << (tr ? "YES\n" : "NO\n");
  }
  return 0;
}
