#include<bits/stdc++.h>
using namespace std;
#define N 1000010
stack<int> tmp;
int in[N], out[N], t, n, cnt;
int main() {
	cin >> t;
	for (int x = 1; x <= t; x++) {
		cin >> n;
		cnt = 0;
		for (int i = 0; i < n; i++) cin >> in[i];
		for (int i = 0; i < n; i++) {
			cin >> out[i];
			if (cnt < out[i]) for (int j = cnt; j < out[i]; j++) tmp.push(in[j]), cnt++;
			if (tmp.top() == out[i]) tmp.pop();
			else break;
		}
		cout << (tmp.empty() ? "Yes\n":"No\n");
		while (!tmp.empty()) tmp.pop();
	}
	return 0;
}