#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
template<class T> using V = vector<T>;
using VI = V<int>;
using VL = V<ll>;
using VS = V<string>;
template<class T> using PQ = priority_queue<T, V<T>, greater<T>>;
using graph = V<VI>;
template<class T> using w_graph = V<V<pair<int, T>>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define inside(h,w,y,x) (unsigned(y)<h&&unsigned(x)<w)
#ifdef _DEBUG
#define line cout << "-----------------------------\n"
#define stop system("pause")
#endif
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 61;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr int dy[]{ -1,0,1,0 }, dx[]{ 0,1,0,-1 };
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T> inline istream& operator>>(istream& is, V<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T> inline V<T> vec(size_t a) { return V<T>(a); }
template<class T> inline V<T> defvec(T def, size_t a) { return V<T>(a, def); }
template<class T, class... Ts> inline auto vec(size_t a, Ts... ts) { return V<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts> inline auto defvec(T def, size_t a, Ts... ts) { return V<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T> inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts> inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T> inline void print(const V<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T> inline void print(const V<V<T>>& v) { for (auto& a : v)print(a); }
template<class T> inline constexpr const T& cumsum(const V<T>& a, int l, int r) { return 0 <= l && l <= r && r < a.size() ? a[r] - (l == 0 ? 0 : a[l - 1]) : 0; }//[l,r]
template<class T> inline constexpr const T& min(const V<T>& v) { return *min_element(all(v)); }
template<class T> inline constexpr const T& max(const V<T>& v) { return *max_element(all(v)); }

template<class Op> class SparseTable {
    using T = typename Op::T;
    vector<vector<T>> dat;
    VI len;
    int n, log;
public:
    SparseTable(const vector<T>& a) : n(a.size()), log(log2(n)) {
        dat = vec<T>(log + 1, n);
        len.resize(n + 1);
        FOR(i, 0, n)dat[0][i] = a[i];
        FOR(j, 0, log)FOR(i, 0, n - (1 << j)) {
            dat[j + 1][i] = Op::comp(dat[j][i], dat[j][i + (1 << j)]);
        }
        eFOR(i, 2, n)len[i] = len[i >> 1] + 1;
    }
    T value(int l, int r) {
        int k = len[r - l];
        return Op::comp(dat[k][l], dat[k][r - (1 << k)]);
    }
};
template<class Type> struct node {
    using T = Type;
    inline static T comp(T x, T y) { return max(x, y); }
};

void solve(int t_idx) {
    int n; cin >> n;
    VI a(n), b(n);
    FOR(i, 0, n) {
        cin >> a[i];
        --a[i];
    }
    FOR(i, 0, n) {
        cin >> b[i];
        --b[i];
    }

#ifdef _DEBUG
    printf("case %d: ", t_idx);
#endif

    SparseTable<node<int>> sp(a);
    V<VI> pa(n), pb(n);
    set<int> sa, sb;
    sa.insert(-1), sa.insert(n);
    sb.insert(-1), sb.insert(n);
    FOR(i, 0, n) {
        pa[a[i]].push_back(i);
        pb[b[i]].push_back(i);
        sa.insert(i);
    }
    FOR(j, 0, n) {
        for (int i : pa[j])sa.erase(i);
        for (int i : pb[j]) {
            int l = -1, r = n;
            if (auto it = sa.lower_bound(i); true) {
                chmin(r, *it);
                chmax(l, *prev(it));
            }
            if (auto it = sb.lower_bound(i); true) {
                chmin(r, *it);
                chmax(l, *prev(it));
            }
            ++l, --r;
            if (r < i || i < l || l > r || sp.value(l, r + 1) != b[i]) {
                print("No");
                return;
            }
        }
        for (int i : pb[j])sb.insert(i);
    }
    print("Yes");
}

int main() {
    init();

    int t; cin >> t;
    eFOR(i, 1, t)solve(i);

    return 0;
}