#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using S = int;
using F = int;
S op(S a, S b) { return max(a, b); }
S e() { return -INF; }
S mapping(F f, S x) { return (f == -INF ? x : f); }
F composition(F f, F g) { return (f == -INF ? g : f); }
F id() { return -INF; }
int target;
bool f(int v) { return v <= target; }
bool solve() {
	int n; cin >> n;
	vector<int>a(n), b(n);
	vector<vector<int>>idxa(n), idxb(n);
	rep(i, n) {
		cin >> a[i]; a[i]--;
		idxa[a[i]].push_back(i);
	}
	rep(i, n) {
		cin >> b[i]; b[i]--;
		idxb[b[i]].push_back(i);
	}
	lazy_segtree<S, op, e, F, mapping, composition, id> seg(a);
	bool chk = true;
	rep(i, n) {
		for (auto e : idxa[i]) {
			target = i;
			int l = seg.min_left(e + 1, f);
			int r = seg.max_right(e, f);
			seg.apply(l, r, i);
		}
		for (auto e : idxb[i]) {
			if (i != seg.get(e)) return false;
			seg.set(e, INF);
		}
	}
	return true;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		if (solve()) cout << "Yes" << endl;
		else cout << "No" << endl;
	}
	return 0;
}