#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
using namespace std;
inline long long read() {
  long long x = 0, f = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = (x << 3) + (x << 1) + (c ^ 48);
    c = getchar();
  }
  return f == 1 ? x : -x;
}
inline void print(long long x) {
  if (x < 0) x = ~x + 1, putchar('-');
  if (x >= 10) print(x / 10);
  putchar((x % 10) | 48);
}
long long T;
long long n;
long long a[2000010];
long long b[2000010];
signed main() {
  T = read();
  while (T--) {
    n = read();
    bool flag = 0;
    for (long long i = 1; i <= n; ++i) a[i] = a[i + n] = read();
    for (long long i = 1; i <= n; ++i) b[i] = b[i + n] = read();
    long long sum = 0;
    for (long long i = 1; i <= n; ++i) sum += a[i] - b[i];
    if (sum > 0)
      printf("NO\n");
    else {
      sum = 0;
      long long minn = b[1];
      for (long long i = 1; i <= 2 * n; ++i) {
        sum += a[i % n + 1] - b[i % n + 1];
        minn = min(minn, sum + b[i % n + 1]);
        if (minn < sum) {
          flag = 1;
          break;
        }
      }
      if (flag)
        printf("NO\n");
      else
        printf("YES\n");
    }
  }
  return 0;
}
