#include <bits/stdc++.h>
using namespace std;
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    vector<long long> a(n), b(n);
    for (auto &x : a) cin >> x;
    for (auto &x : b) cin >> x;
    if (accumulate(a.begin(), a.end(), 0ll) >
        accumulate(b.begin(), b.end(), 0ll)) {
      cout << "NO\n";
      continue;
    }
    bool ok = true;
    deque<pair<long long, long long>> q;
    long long sum = 0;
    for (long long i = 0; i < n + n; i++) {
      sum += b[i % n] - a[i % n];
      long long pref = sum - b[i % n];
      while (!q.empty() && i - q.front().first >= n) {
        q.pop_front();
      }
      while (!q.empty() && pref >= q.back().second) {
        q.pop_back();
      }
      q.push_back({i, pref});
      if (!q.empty() && sum - q.front().second < 0) {
        ok = false;
        break;
      }
    }
    if (ok)
      cout << "YES\n";
    else
      cout << "NO\n";
  }
}
