#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 7;
int a[N], b[N];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    long long sum = 0;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) cin >> b[i];
    for (int i = 0; i < n; i++) sum += b[i] - a[i];
    for (int i = 0; i < n; i++) a[i + n] = a[i];
    for (int i = 0; i < n; i++) b[i + n] = b[i];
    bool good = (sum >= 0);
    long long dp = 0;
    for (int i = 2 * n - 1; i >= 0; i--) {
      int d = b[i] - a[i];
      if (b[i] + dp < 0) good = false;
      dp = min(0LL, dp + d);
    }
    cout << (good ? "YES" : "NO") << endl;
  }
}
