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

typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef pair<int,int> Pair;
typedef tuple<int,int,int> tpl;

#define ALL(a)  (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define REVERSE(c) reverse((c).begin(),(c).end())
#define EXIST(m,v) (m).find((v)) != (m).end()
#define LB(a,x) lower_bound((a).begin(), (a).end(), x) - (a).begin()
#define UB(a,x) upper_bound((a).begin(), (a).end(), x) - (a).begin()

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i)
#define RREP(i,n) RFOR(i,n,0)

#define en "\n"

constexpr double EPS = 1e-9;
constexpr double PI  = 3.1415926535897932;
constexpr int INF = 2147483647;
constexpr long long LINF = 1LL<<60;
constexpr long long MOD =  998244353; // 1000000007;

template<class T> inline bool chmax(T& a, T b){if(a<b){a=b;return true;}return false;}
template<class T> inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;}

#include <atcoder/lazysegtree>
#include <atcoder/segtree>

using S1 = bool;
S1 op1(S1 a, S1 b){return a or b;}
S1 e1(){return false;}

using S = int;
using F = int;
S op(S a, S b){return max(a,b);}
S e(){return -1;}
F id(){return -1;}
S mapping(F a, S b){return max(a,b);}
F composition(F a, F b){return max(a,b);}

void Main(){
    int N; cin >> N;
    VI A(N); REP(i,N) cin >> A[i], A[i]--;
    VI B(N); REP(i,N) cin >> B[i], B[i]--;

    VI p(N); REP(i,N) p[i] = i;
    sort(ALL(p), [&](int i, int j){return A[i]<A[j];});
    VVI b(N); REP(i,N) b[B[i]].push_back(i);

    atcoder::segtree<S1,op1,e1> st(vector<S1>(N,false));
    atcoder::lazy_segtree<S,op,e,F,mapping,composition,id> lst(A);

    auto min_left = [&](int r){
        int ng = -1, ok = r;
        while(ok-ng>1){
            int pos = (ok+ng)/2;
            if(!st.prod(pos, r)) ok = pos;
            else ng = pos;
        }
        return ok;
    };
    auto max_right = [&](int l){
        int ok = l, ng = N+1;
        while(ng-ok>1){
            int pos = (ok+ng)/2;
            if(!st.prod(l, pos)) ok = pos;
            else ng = pos;
        }
        return ok;
    };


    REP(i,N){
        int pos = p[i], prev = i == 0 ? 0 : A[p[i-1]];
        FOR(j, prev, A[pos]){
            for(int x : b[j]) st.set(x, true);
        }

        int l = min_left(pos+1), r = max_right(pos);
        if(l < r){
            lst.apply(l, r, A[pos]);
        }
    }

    REP(i,N){
        if(lst.get(i) != B[i]){
            cout << "No" << en;
            return;
        }
    }
    cout << "Yes" << en;
    return;
}

int main(void){
    cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);cout<<fixed<<setprecision(15);
    int t=1; cin>>t;
    while(t--) Main();
    return 0;
}