#include<iostream>
#include<istream>
#include<ostream>
#include<string>
#include<algorithm>
#include<bitset>
#include<cmath>
#include<queue>
#include<map>
#include<iomanip>
using namespace std;
int q,n[114514],pushed[11451419],poped[11451419],bock[11451419];
int main(){
	cin>>q;
	for(int j = 0;j < q;j++){
		cin>>n[j];
		for(int i = 0;i < n[j];i++) cin>>pushed[i];
		for(int i = 0;i < n[j];i++) cin>>poped[i];
		
		for(int i = n[j] - 1;i >= 0;i--){
			int cnt = 0;
			bock[cnt] = poped[i];
			cnt++;
		}
		
		bool flag = false;
		for(int i = 0;i < n[j];i++) if(pushed[i] != bock[i]) flag = true;
		
		if(!flag) cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
	}

	return 0;
}