#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(int i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
//using mint=modint1000000007;
using mint=modint998244353;
void chmax(ll&a,ll b){a=max(a,b);}
void chmin(ll&a,ll b){a=min(a,b);}
signed main(){
  int T,N;cin>>T;
  while(T--){
    scanf("%d",&N);
    vector<int>A(N),B(N);
    REP(i,N)scanf("%d",&A[i]);
    REP(i,N)scanf("%d",&B[i]);
    set<int>S;REP(i,N)S.insert(A[i]);
    bool ans=1;dsu D(N);
    vector<map<int,bool>>M(N);
    vector<vector<int>>X(N+1);
    REP(i,N){
      ans=ans&&S.count(B[i])&&A[i]<=B[i];
      M[i].clear();M[i][A[i]]=1;X[i+1].clear();
      if(i==0||B[i-1]!=B[i])X[B[i]].emplace_back(i);
    }
    REP(i,N-1)if(B[i]==B[i+1]){
      int u=D.leader(i),v=D.leader(i+1),r=D.merge(u,v);
      if(r==u)for(auto[key,val]:M[v])M[u][key]=M[u][key]||val;
      else for(auto[key,val]:M[u])M[v][key]=M[v][key]||val;
    }
    RREP(v,N+1){
      for(auto i:X[v]){
        int l=i,r=N-1;
        while(l!=r){int m=(l+r+1)/2;if(D.same(i,m))l=m;else r=m-1;}
        if(i&&B[i-1]>B[i]){
          int u=D.leader(i-1),v=D.leader(i),r=D.merge(u,v);
          if(r==u)for(auto[key,val]:M[v])M[u][key]=M[u][key]||val;
          else for(auto[key,val]:M[u])M[v][key]=M[v][key]||val;
        }
        if(l<N-1&&B[l+1]>B[l]){
          int u=D.leader(l+1),v=D.leader(l),r=D.merge(u,v);
          if(r==u)for(auto[key,val]:M[v])M[u][key]=M[u][key]||val;
          else for(auto[key,val]:M[u])M[v][key]=M[v][key]||val;
        }
        ans=ans&&M[D.leader(i)][v];
      }
    }
    if(ans)printf("Yes\n");
    else printf("No\n");
  }
  return 0;
}