B_Crafting.cpp

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<bool> vbl;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vstr;
typedef vector<pll> vpll;

#define endl '\n'
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
constexpr ll mod = 1000000007;

inline void Parvez() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); }
template<class T>inline istream& operator>>(istream& in, vector<T>& v) { for (T& x : v) { in >> x; }return in; }template<class T>inline ostream& operator<<(ostream& out, vector<T>& v) { for (ll i = 0;i < v.size() - 1;i++) { out << v[i] << ' '; }out << v[v.size() - 1];return out; }
inline void inp() {}template<class H, class... T>inline void inp(H&& h, T &&...t) { cin >> h;inp(forward<T>(t)...); }inline void print() { cout << endl; }template<class H, class... T>inline void print(H&& h, T &&...t) { cout << h;if (sizeof...(t) != 0)cout << ' ';print(forward<T>(t)...); }




void solution(ll& T) {
	ll n; inp(n);
	vll a(n), b(n); inp(a, b);
	ll d = 0;
	vll dist(n);
	ll ttl = 0;
	ll cnt = 0;
	for (ll i = 0; i < n; i++) {
		dist[i] = a[i] - b[i];
		if (dist[i] < 0) ttl += -dist[i], cnt += 1;
	}
	if (cnt > 1) {
		print("NO");return;
	}
	if (cnt == 1 and count(all(dist), 0) > 0) {
		print("NO"); return;
	}
	if (cnt == 1) {
		ll mn = *min_element(all(dist));
		ll second_min = INT_MAX;
		for (ll i = 0; i < n; i++) {
			if (dist[i] > 0) {
				second_min = min(dist[i], second_min);
			}
		}
		if (second_min < abs(mn)) {
			print("NO");return;
		}
	}
	print("YES");
}

signed main() {
	Parvez();
	ll TT = 1;
	cin >> TT;
	for (ll T = 1;T <= TT;T++)
		solution(T);
	return 0;
}