#include <bits/stdc++.h>
using namespace std;
char buffer[2000020], *p1, *p2;
template <class T>
void read(T& x) {
  char ch = ((p1 == p2 &&
              (p2 = (p1 = buffer) + fread(buffer, 1, 2000020, stdin), p1 == p2))
                 ? EOF
                 : *p1++);
  x = 0;
  bool f = 1;
  while (!('0' <= ch && ch <= '9') && ch != '-')
    ch = ((p1 == p2 &&
           (p2 = (p1 = buffer) + fread(buffer, 1, 2000020, stdin), p1 == p2))
              ? EOF
              : *p1++);
  if (ch == '-')
    f = 0,
    ch = ((p1 == p2 &&
           (p2 = (p1 = buffer) + fread(buffer, 1, 2000020, stdin), p1 == p2))
              ? EOF
              : *p1++);
  while ('0' <= ch && ch <= '9')
    x = (x << 1) + (x << 3) + ch - '0',
    ch = ((p1 == p2 &&
           (p2 = (p1 = buffer) + fread(buffer, 1, 2000020, stdin), p1 == p2))
              ? EOF
              : *p1++);
  x = (f) ? x : -x;
}
int _num[20];
template <class T>
void write(T x) {
  if (!x) {
    putchar('0'), putchar('\n');
    return;
  }
  if (x < 0) putchar('-'), x = -x;
  int c = 0;
  while (x) _num[++c] = x % 10, x /= 10;
  while (c) putchar('0' + _num[c--]);
  putchar('\n');
}
int n;
long long int a[2000020], b[2000020], c[2000020 << 1];
long long int st[2000020 << 1];
int head = 0, tail = 0;
inline void add(int i) {
  while (head > tail && c[i] >= c[st[head]]) head--;
  st[++head] = i;
}
inline void del(int i) {
  if (st[tail + 1] == i) tail++;
}
int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    head = tail = 0;
    scanf("%d", &n);
    long long int sa = 0, sb = 0;
    for (register int i = 1; i <= n; i++) scanf("%lld", a + i), sa += a[i];
    for (register int i = 1; i <= n; i++) scanf("%lld", b + i), sb += b[i];
    if (sa > sb) {
      printf("NO\n");
      continue;
    }
    for (register int i = 1; i <= n; i++) c[i] = a[i] - b[i], c[i + n] = c[i];
    for (register int i = 1; i <= 2 * n; i++) c[i] += c[i - 1];
    long long int mx = 0;
    for (register int i = 2; i <= n; i++) add(i);
    for (register int i = 1; i <= n; i++) {
      mx = max(mx, c[st[tail + 1]] - c[i] - b[i]);
      add(n + i), del(i + 1);
    }
    if (mx == 0)
      printf("YES\n");
    else
      printf("NO\n");
  }
  return 0;
}
