#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb push_back
#define eb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> bool chmax(T& x, U y){
	if(x<y){ x=y; return true; }
	return false;
}
template<class T,class U> bool chmin(T& x, U y){
	if(y<x){ x=y; return true; }
	return false;
}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}
template<class T>
V<T> Vec(size_t a) {
    return V<T>(a);
}
template<class T, class... Ts>
auto Vec(size_t a, Ts... ts) {
  return V<decltype(Vec<T>(ts...))>(a, Vec<T>(ts...));
}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ~ ";
	dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {";  \
	for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif

template<class D> D divFloor(D a, D b){
	return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}
template<class D> D divCeil(D a, D b) {
	return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);
}
bool solve(){
	int N; cin >> N;
	auto in_cycle = [&](V<int>& A, int v){
		int x = v;
		rep(_,N){
			x = A[x];
			if(x == v) return true;
		}
		return false;
	};
	V<int> A(N); rep(i,N) cin >> A[i],A[i]--;
	V<int> B(N); rep(i,N) cin >> B[i],B[i]--;
	rep(i,N){
		int x = A[i];
		bool ok = false;
		rep(_,N){
			if(x == B[i]) ok = true;
			x = A[x];
		}
		if(!ok) return false;
	}
	int Ac = 0, Bc = 0;
	{
		V<bool> done(N);
		rep(v,N) if(!done[v] && in_cycle(A,v)){
			Ac++;
			int x = v;
			rep(_,N){
				done[x] = true;
				x = A[x];
			}
		}
	}
	V<bool> done(N);
	rep(v,N) if(!done[v] && in_cycle(B,v)){
		Bc++;
		{
			int x = v;
			rep(_,N){
				done[x] = true;
				x = B[x];
			}
		}
		int b = v;
		if(B[b] == b) continue;
		int loop = 0;
		while(true){
			int a = b;
			int nb = B[b];
			while(a != nb){
				a = A[a];
				if(a == v) loop++;
			}
			b = nb;
			if(b == v) break;
		}
		if(loop > 1) return false;
	}
	return true;
}
int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);

	int T; cin >> T;
	while(T--) cout << (solve() ? "Yes" : "No") << endl;
}