#include <bits/stdc++.h>
using namespace std;
template <typename T>
void deb(initializer_list<T> l) {
  for (auto& e : l) cout << e << ' ';
  cout << endl;
}
long long n;
pair<bool, long long> check(long long give, vector<long long> a,
                            vector<long long> b) {
  b[0] -= give;
  a[1] -= give;
  for (long long i = 1; i < n; ++i) {
    if (a[i] > b[i]) return {false, 0};
    b[i] -= a[i];
    a[i] = 0;
    a[(i + 1) % n] -= min(a[(i + 1) % n], b[i]);
  }
  a[0] -= min(a[0], b[0]);
  return {true, a[0]};
}
void solve() {
  cin >> n;
  vector<long long> a(n), b(n);
  for (auto& e : a) cin >> e;
  for (auto& e : b) cin >> e;
  long long low = 0;
  long long high = min(a[1], b[0]);
  while (low <= high) {
    long long mid = low + (high - low) / 2;
    if (auto [poss, demand] = check(mid, a, b); poss) {
      if (demand == 0) {
        cout << "YES\n";
        return;
      }
      high = mid - 1;
    } else
      low = mid + 1;
  }
  cout << "NO\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int t = 1;
  cin >> t;
  while (t--) solve();
  return 0;
}
