#include <bits/stdc++.h>
#pragma optimize("-O3")
using namespace std;
const long long mod = 998244353;
int n, a[1000006], b[1000006];
int extra[1000006];
void no() { cout << "NO" << '\n'; }
void yes() { cout << "YES" << '\n'; }
void solve() {
  cin >> n;
  for (long long i = (long long)0; i != (long long)n; i = i + 1) cin >> a[i];
  ;
  for (long long i = (long long)0; i != (long long)n; i = i + 1) cin >> b[i];
  ;
  extra[0] = b[0];
  for (long long i = (long long)1; i != (long long)n; i = i + 1) {
    extra[i] = max(0, min(b[i], extra[i - 1] + (b[i] - a[i])));
  }
  extra[0] = max(0, min(b[0], extra[n - 1] + (b[0] - a[0])));
  for (long long i = (long long)1; i != (long long)n; i = i + 1) {
    extra[i] = max(0, min(b[i], extra[i - 1] + (b[i] - a[i])));
  }
  for (long long i = (long long)0; i != (long long)n; i = i + 1) {
    if (extra[i] + b[(i + 1) % n] < a[(i + 1) % n] + extra[(i + 1) % n]) {
      no();
      return;
    }
  }
  yes();
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    solve();
  }
}
