#pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << "\n";}
template<typename T, typename...U>
void dout(T t, U...u) {cout << t << (sizeof...(u) ? ", " : ""), dout(u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const int SIZE = 1e6 + 5;

int n;
int a[SIZE], b[SIZE], win[SIZE];

void solve() {
    cin >> n;
    FOR (i, 1, n) cin >> a[i];
    FOR (i, 1, n) cin >> b[i];
    FOR (i, 1, n) win[i] = b[i] - a[i];
    if (n == 2 && win[2] > 0) {
        cout << "NO\n";
        return;
    }
    priority_queue<pair<int, int>> pq;
    FOR (i, 2, n) pq.emplace(win[i], i);
    int cnt = 0;
    queue<int> q;
    q.push(1);
    while (q.size()) {
        int pos = q.front();
        q.pop();
        while (win[pos] > 0 && pq.size()) {
            auto [d, np] = pq.top();
            pq.pop();
            win[pos]--;
            q.push(np);
        }
        cnt++;
    }
    cout << (cnt == n ? "YES\n" : "NO\n");
}

int main() {
    Waimai;
    int tt;
    cin >> tt;
    while (tt--) solve();
}