#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t;
  scanf("%d", &t);
  while (t--) {
    int n;
    scanf("%d", &n);
    vector<long long> houses(n);
    for (auto &a : houses) scanf("%lld", &a);
    vector<long long> stations(n);
    for (auto &a : stations) scanf("%lld", &a);
    long long hf = 0, sf = 0;
    for (auto &a : houses) hf += a;
    for (auto &a : stations) sf += a;
    if (hf > sf) {
      puts("NO");
      continue;
    }
    long long large = 0, total = stations[0];
    bool good = 1;
    for (int i = 1; i <= 2 * n; i++) {
      int st = stations[i % n], sth = houses[i % n];
      total += st - sth;
      if (total - large < 0) {
        good = 0;
        break;
      }
      large = max(large, total - st);
    }
    if (good)
      puts("YES");
    else
      puts("NO");
  }
  return 0;
}
