#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 1e6 + 5;
int n, a[N], b[N], c[N], d[N];
string solve() {
  cin >> n;
  for (int i = 0, ggdem = n; i < ggdem; i++) cin >> a[i];
  for (int i = 0, ggdem = n; i < ggdem; i++) cin >> b[i];
  for (int i = 0, ggdem = n; i < ggdem; i++) c[i] = b[i];
  for (int i = 0, ggdem = n; i < ggdem; i++) d[i] = 0;
  for (int _ = 0, ggdem = 2; _ < ggdem; _++) {
    for (int i = 0, ggdem = n; i < ggdem; i++) {
      int ex = min(max(0, c[i] - a[i]), b[i] - d[i]);
      c[(i + 1) % n] += ex;
      c[i] -= ex;
      d[i] += ex;
    }
  }
  for (int i = 0, ggdem = n; i < ggdem; i++)
    if (c[i] < a[i]) return "NO";
  return "YES";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int q;
  cin >> q;
  while (q--) cout << solve() << "\n";
}
