#include<bits/stdc++.h>
using namespace std;

#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=MOD;
const ll MAX=200010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;

//SegmentTree
template< typename Monoid >
struct SegmentTree
{
  using F = function< Monoid(Monoid, Monoid) >;
 
  int sz;
  vector< Monoid > seg;
 
  const F f;
  const Monoid M1;
 
  SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1)
  {
    sz = 1;
    while(sz < n) sz <<= 1;
    seg.assign(2 * sz, M1);
  }
 
  void set(int k, const Monoid &x)
  {
    seg[k + sz] = x;
  }
 
  void build()
  {
    for(int k = sz - 1; k > 0; k--) {
      seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
    }
  }
 
  void update(int k, const Monoid &x)
  {
    k += sz;
    seg[k] = x;
    while(k >>= 1) {
      seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
    }
  }
 
  Monoid query(int a, int b)
  {
    Monoid L = M1, R = M1;
    for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
      if(a & 1) L = f(L, seg[a++]);
      if(b & 1) R = f(seg[--b], R);
    }
    return f(L, R);
  }
 
  Monoid operator[](const int &k) const
  {
    return seg[k + sz];
  }
};


void solve(){
    ll t;cin>>t;
    while(t--){
        ll n;cin>>n;
        vector<ll>a(n),b(n);
        vector<vector<ll> >c(n);
        vector<pll>d(n);
        SegmentTree<ll>seg(n,[](ll a,ll b){return max(a,b);},0);
        rep(i,n){
            cin>>a[i];
            a[i]--;
            c[a[i]].pb(i);
            seg.update(i,a[i]);
        }
        rep(i,n){
            cin>>b[i];
            b[i]--;
            d[i]=mp(b[i],i);
        }
        sort(all(d));
        bool ans=1;
        set<ll>st,st2;
        queue<ll>q;
        rep(i,n){
            ll k=d[i].se;
            if(b[k]<a[k]){
                ans=0;
                break;
            }else if(b[k]>a[k]){
                auto itr=lower_bound(all(c[b[k]]),k);
                bool f=0;
                if(itr!=c[b[k]].end()){
                    ll s=*itr;
                    auto itr2=st.lower_bound(k);
                    if(seg.query(k,s+1)<=b[k]){
                        if(itr2!=st.end()){
                            ll z=*itr2;
                            if(z>s){
                                f=1;
                            }
                        }else{
                            f=1;
                        }
                    }
                }
                if(itr!=c[b[k]].begin()){
                    itr--;
                    ll s=*itr;
                    auto itr2=st2.lower_bound(-k);
                    if(seg.query(s,k+1)<=b[k]){
                        if(itr2!=st2.end()){
                            ll z=-*itr2;
                            if(z<s){
                                f=1;
                            }
                        }else{
                            f=1;
                        }
                    }
                }
                if(!f){
                    ans=0;
                    break;
                }
            }
            q.push(k);
            if(i<n-1&&d[i+1].fi>d[i].fi){
                while(!q.empty()){
                    ll l=q.front();
                    q.pop();
                    st.insert(l);
                    st2.insert(-l);
                }
            }
        }
        cout<<(ans?"Yes":"No")<<endl;
    }
}

signed main(){
    //cin.tie(0);
    //ios::sync_with_stdio(false);
    solve();
}