#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long lnf = 0x3f3f3f3f3f3f3f3f;
const double dnf = 1e18;
const int mod = 1000000007;
const double eps = 1e-8;
const double pi = acos(-1.0);
const int maxn = 2000100;
const int maxm = 100100;
const int up = 100000;
long long dp[maxn];
long long a[maxn], b[maxn];
int main(void) {
  int t;
  scanf("%d", &t);
  while (t--) {
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]), a[i + n] = a[i];
    for (int i = 1; i <= n; i++) scanf("%d", &b[i]), b[i + n] = b[i];
    bool flag = false;
    for (int i = 1; i <= n * 2; i++) {
      dp[i] =
          ((b[i] - a[i]) >
                   (b[i] +
                    ((0ll) > (((0ll) > (dp[i - 1]) ? (0ll) : (dp[i - 1])) -
                              a[i])
                         ? (((0ll) > (dp[i - 1]) ? (0ll) : (dp[i - 1])) - a[i])
                         : (0ll)))
               ? (b[i] - a[i])
               : (b[i] +
                  ((0ll) > (((0ll) > (dp[i - 1]) ? (0ll) : (dp[i - 1])) - a[i])
                       ? (((0ll) > (dp[i - 1]) ? (0ll) : (dp[i - 1])) - a[i])
                       : (0ll))));
      if (i >= n && dp[i] < 0) flag = true;
    }
    if (!flag)
      printf("YES\n");
    else
      printf("NO\n");
  }
  return 0;
}
