#include <bits/stdc++.h>
using namespace std;
const int maxN = 1e6 + 10;
int a[maxN], b[maxN], c[maxN];
long long dist[maxN];
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; ++i) {
      scanf("%d", a + i);
    }
    for (int i = 0; i < n; ++i) {
      scanf("%d", b + i);
    }
    for (int i = 0; i < n; ++i) {
      c[i] = b[i] - a[(i + 1) % n];
    }
    if (accumulate(c, c + n, 0ll) < 0) {
      puts("NO");
      continue;
    }
    for (int i = 0; i < n; ++i) {
      dist[i] = 0;
    }
    long long min_dist = 0;
    for (int i = 0; i < 2 * n; ++i) {
      dist[i % n] = min(min_dist, dist[i % n]);
      min_dist = min(0ll, dist[i % n] + c[i % n]);
    }
    bool ok = 1;
    for (int i = 0; i < n; ++i) {
      if (dist[(i + 1) % n] - dist[i] > c[i]) ok = 0;
      if (-dist[i] > b[i]) ok = 0;
    }
    if (ok)
      puts("YES");
    else
      puts("NO");
  }
  return 0;
}
