#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

struct UnionFind {
    vector<int> par;
    vector<int> edge;
    //vector<int> left,right;
    
    UnionFind(int n) : par(n, -1),edge(n, 0){ //left(n,0),right(n,0){
        //rep(i,n)left[i]=i;
        //rep(i,n)right[i]=i;
    }

    int root(int x) {
        if (par[x] < 0) return x;
        else return par[x] = root(par[x]);
    }
    
    bool same(int x, int y) {
        return root(x) == root(y);
    }
    
    bool merge(int x, int y) {
        x = root(x); y = root(y);
        if (x == y) {
            edge[x]++;
            return false;
        }
        if (par[x] > par[y]) swap(x, y);
        par[x] += par[y];
        par[y] = x;
        edge[x] += edge[y]+1;
        //left[x]=min(left[x],left[y]);
        //right[x]=max(right[x],right[y]);
        return true;
    }
    
    int size(int x) {
        return -par[root(x)];
    }
};

void solve(){
    ll n;cin >> n;
    vvl plsa(n),plsb(n);
    rep(i,n){
        ll a;cin >> a;a--;plsa[a].emplace_back(i);
    }
    rep(i,n){
        ll b;cin >> b;b--;plsb[b].emplace_back(i);
    }
    bool ok=true;
    UnionFind uf(n);
    vl use(n);
    rep(i,n){
        for(auto p:plsa[i]){
            if(p-1>=0&&use[p-1])uf.merge(p-1,p);
            if(p+1<n&&use[p+1])uf.merge(p,p+1);
            use[p]++;
        }
        set<ll> st;
        for(auto p:plsa[i])st.insert(uf.root(p));
        for(auto q:plsb[i]){
            if(!st.count(uf.root(q)))ok=false;
        }
    }
    cout << (ok? "Yes":"No") << endl;
}
int main(){
    ll t;cin >> t;
    while(t--)solve();
}