#include<iostream>
#include<stack>
#include<algorithm>
using namespace std;
stack<int> stk;
int n, m, k;
int main() {
	cin >> n;
	int cnt = 0, r = 0;
	while (n--) {
		cin >> m;
		for (int i = 1; i <= m; i++) {
			cin >> k;
			stk.push(k);
		}
		for (int i = 1; i <= m; i++) {
			cin >> k;
			if (k != stk.top() && cnt == 0) {
				cout << "NO" << endl;
				r = 1;
				cnt++;
			}
			stk.pop();
		}
		if (!r)cout << "YES" << endl;
	}
	return 0;
}