#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=a;i<b;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}


namespace po167{
struct UFtree
{
	using _F=int;
	int _n;
	std::vector<_F> wei;
	std::vector<int> q;
	int component;
	UFtree(int n):_n(n),wei(n),component(n),par(n){
		for(int i=0;i<n;i++){
			wei[i]=1,par[i]=i;
		}
	}
	void intialize(){
		for(auto x:q){
			wei[root(x)]=1;
			par[x]=x;
		}
		component=(int)par.size();
		q={};
	}
	//根っこを返す
	int root(int a){
		assert(0<=a&&a<_n);
		if(a==par[a]) return a;
		return par[a]=root(par[a]);
	}
	//trueなら1,falseなら0
	int same(int a,int b){
		assert(0<=a&&a<_n);
		assert(0<=b&&b<_n);
		if(root(a)==root(b)) return 1;
		else return 0;
	}
	_F size(int a){
		return wei[root(a)];
	}
	//a,bが違う根っこの元なら結合する,結合したらtrueを返す
	bool unite(int a,int b){
		a=root(a),b=root(b);
		if(a==b) return false;
		if(a<b) std::swap(a,b);
		par[b]=a;
		q.push_back(b);
		wei[a]+=wei[b];
		component--;
		return true;
	}
	private:
	std::vector<int> par;
};
}
using po167::UFtree;


void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	cin>>t;
	rep(i,0,t) solve();
}

void solve(){
	int N;
	cin>>N;
	vector<int> A(N),B(N);
	rep(i,0,N) cin>>A[i],A[i]--;
	rep(i,0,N) cin>>B[i],B[i]--;
	UFtree T(N),U(N);
	rep(i,0,N) T.unite(i,A[i]);
	rep(i,0,N) U.unite(i,B[i]);
	rep(i,0,N){
		if(T.root(i)!=U.root(i)){
			yneos(0);
			return;
		}
	}
	rep(i,0,N){
		vector<int> seen(N);
		bool ok=0;
		int ind=i;
		while(seen[ind]==0){
			if(ind==B[i]) ok=1;
			seen[ind]=1;
			ind=A[ind];
		}
		if(!ok){
			yneos(0);
			return;
		}
	}
	vector<int> seen(N),seen2(N);
	auto f=[&](vector<int> &p,int s)->vector<int>{
		swap(seen,seen2);
		rep(i,0,N) s=p[s];
		vector<int> res;
		while(seen[s]==0){
			res.push_back(s);
			seen[s]=1;
			s=p[s];
		}
		return res;
	};
	rep(i,0,N){
		if(T.root(i)!=i) continue;
		auto X=f(A,i);
		auto Y=f(B,i);
		int L=X.size();
		int M=Y.size();
		bool ok=0;
		rep(j,0,L){
			if(X[0]==Y[0]){
				ok=1;
				break;
			}
			rep(l,0,L-1) swap(X[l],X[l+1]);
		}
		if(ok){
			int ind=0;
			rep(j,0,M){
				while(ind!=L&&Y[j]!=X[ind]) ind++;
				if(ind==L) ok=0;
				ind++;
			}
		}
		if(!ok){
			yneos(0);
			return;
		}
	}
	yneos(1);
}