#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;

#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b) - 1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a) - 1; i >= 0; i--)

#define sz(x) (int) (x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define ub upper_bound
#define lb lower_bound
#define all(x) x.begin(), x.end()

const char nl = '\n';

void solve() {
	int N; cin >> N;
	vpl A(N); F0R(i, N) cin >> A[i].f;
	F0R(i, N) cin >> A[i].s;

	F0R(iter, N-1) {
		sort(all(A));
		ll sum = 0;
		F0R(i, N) {
			sum += A[i].s;
		}
		F0Rd(i, N) {
			int p = 0; if (i == 0) p = 1;
			if (A[i].f + sum - A[i].s <= A[p].f) {
				A.erase(A.begin() + p); goto done;
			}
		}
		cout << "No" << nl; return;
		done:
		;
	}
	cout << "Yes" << nl;
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int T; cin >> T;
	while(T--) {
		solve();
	}

}