#include<bits/stdc++.h>
using namespace std;
int a[100005], b[100005], stk[100005], tp, q;
int main () {
	scanf("%d", &q);
	while(q--) {
		int n;
		scanf("%d", &n);
		for(int i = 1;i <= n;++i) scanf("%d", a+i);
		for(int i = 1;i <= n;++i) scanf("%d", b+i);
		int pos = 1, cnt = 0;
		for(int i = 1;i <= n;++i) {
			bool flag = false;
			if(tp)
				if(stk[tp] == b[i]) --tp, flag = true;
			if(flag == false) {
				while(cnt<n && a[++cnt]!=b[i]) stk[++tp] = a[cnt];
				if(a[cnt] == b[i]) flag = true;
				if(a[cnt]!=b[i]) break;
			}
			if(flag == false) break;
			pos = i;
		}
		pos == n ? puts("Yes") : puts("No");
	}
	return 0;
}