#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e6 + 50;
int n;
long long a[N], b[N];
bool solve() {
  cin >> n;
  long long suma = 0, sumb = 0;
  for (int i = 0; i < (n); ++i) cin >> a[i], suma += a[i];
  for (int i = 0; i < (n); ++i) cin >> b[i], sumb += b[i];
  if (suma > sumb) return false;
  long long mxsum = 0;
  for (int i = 2 * n - 1; i >= 0; i--) {
    if (mxsum > b[i % n]) return false;
    mxsum = max(0LL, mxsum + a[i % n] - b[i % n]);
  }
  return true;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int T;
  cin >> T;
  while (T--) {
    cout << (solve() ? "YES" : "NO") << '\n';
  }
}
