#include <bits/stdc++.h>
using namespace std;
const long long NR = 1e6 + 2, oo = 2e12 + 10, MOD1 = 7;
const long double pi = 2 * acos(0.0);
long long sum, a[NR], b[NR], n, t, ok, need;
signed main() {
  int i;
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> t;
  while (t--) {
    ok = 1;
    sum = 0;
    need = 0;
    cin >> n;
    for (i = 0; i < n; ++i) {
      cin >> a[i];
      sum += a[i];
    }
    for (i = 0; i < n; ++i) {
      cin >> b[i];
      sum -= b[i];
    }
    if (sum > 0) ok = 0;
    for (i = 0; i < 1; ++i) {
      need = max(need, 0LL) + a[i] - b[n - 1];
      if (need > a[i]) ok = 0;
    }
    for (i = 1; i < n; ++i) {
      need = max(need, 0LL) + a[i] - b[i - 1];
      if (need > a[i]) ok = 0;
    }
    for (i = n; i < n + 1; ++i) {
      need = max(need, 0LL) + a[i - n] - b[i - 1];
      if (need > a[i - n]) ok = 0;
    }
    for (i = n + 1; i < n + n; ++i) {
      need = max(need, 0LL) + a[i - n] - b[i - 1 - n];
      if (need > a[i - n]) ok = 0;
    }
    if (ok)
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return 0;
}
