//スライド最大値でもできるけど、面倒くさいのでセグ木で殴る
#include <iostream>
#include <atcoder/segtree>
#include <algorithm>
#include <vector>
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;
using namespace atcoder;

int op(int a, int b) { return max(a, b); }
int e() { return -1; }

signed main() {
	int T; cin >> T;
	while (T--) {
		int i, n;
		cin >> n;
		vector<int> a(n), b(n);
		rep(i, n) cin >> a[i];
		rep(i, n) cin >> b[i];
		segtree<int, op, e> seg(a);
		
		int maxA = 0, maxB = 0;
		rep(i, n) maxA = max(maxA, a[i]);
		rep(i, n) maxB = max(maxB, b[i]);
		if (maxA != maxB) { cout << "No" << endl; continue; }
		rep(i, n) if (a[i] > b[i]) break;
		if (i < n) { cout << "No" << endl; continue; }
		
		int left = 0;
		int cor = 0;
		rep(i, n + 1) {
			if (i > 0 && (b[i - 1] != b[i] || i == n)) {
				for (; cor < n; cor++) {
					if (a[cor] == b[i - 1]) {
						break;
					}
				}
				if (cor == n) { break; }
				
				int l = min(i, cor);
				int r = max(i, cor + 1);
				int res = seg.prod(l, r);	//[l, r)
				if (res > a[cor]) { break; }
				left = i;
			}
		}
		if (i < n + 1) {
			cout << "No" << endl;
		}
		else {
			cout << "Yes" << endl;
		}
	}
	return 0;
}