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

namespace internal_scc{
template <class E> struct csr {
    std::vector<int> start;
    std::vector<E> elist;
    csr(int n, const std::vector<std::pair<int, E>>& edges)
        : start(n + 1), elist(edges.size()) {
        for (auto e : edges) {
            start[e.first + 1]++;
        }
        for (int i = 1; i <= n; i++) {
            start[i] += start[i - 1];
        }
        auto counter = start;
        for (auto e : edges) {
            elist[counter[e.first]++] = e.second;
        }
    }
};
struct scc_graph {
  public:
    scc_graph(int n) : _n(n) {}
    int num_vertices() { return _n; }
    void add_edge(int from, int to) { edges.push_back({from, {to}}); }
    std::pair<int, std::vector<int>> scc_ids() {
        auto g = csr<edge>(_n, edges);
        int now_ord = 0, group_num = 0;
        std::vector<int> visited, low(_n), ord(_n, -1), ids(_n);
        visited.reserve(_n);
        auto dfs = [&](auto self, int v) -> void {
            low[v] = ord[v] = now_ord++;
            visited.push_back(v);
            for (int i = g.start[v]; i < g.start[v + 1]; i++) {
                auto to = g.elist[i].to;
                if (ord[to] == -1) {
                    self(self, to);
                    low[v] = std::min(low[v], low[to]);
                } else {
                    low[v] = std::min(low[v], ord[to]);
                }
            }
            if (low[v] == ord[v]) {
                while (true) {
                    int u = visited.back();
                    visited.pop_back();
                    ord[u] = _n;
                    ids[u] = group_num;
                    if (u == v) break;
                }
                group_num++;
            }
        };
        for (int i = 0; i < _n; i++) {
            if (ord[i] == -1) dfs(dfs, i);
        }
        for (auto& x : ids) {
            x = group_num - 1 - x;
        }
        return {group_num, ids};
    }

    std::vector<std::vector<int>> scc() {
        auto ids = scc_ids();
        int group_num = ids.first;
        std::vector<int> counts(group_num);
        for (auto x : ids.second) counts[x]++;
        std::vector<std::vector<int>> groups(ids.first);
        for (int i = 0; i < group_num; i++) {
            groups[i].reserve(counts[i]);
        }
        for (int i = 0; i < _n; i++) {
            groups[ids.second[i]].push_back(i);
        }
        return groups;
    }

  private:
    int _n;
    struct edge {
        int to;
    };
    std::vector<std::pair<int, edge>> edges;
};
}

struct scc_graph {
  public:
    scc_graph() : internal(0) {}
    scc_graph(int n) : internal(n) {}
    void add_edge(int from, int to) {
        int n = internal.num_vertices();
        assert(0 <= from && from < n);
        assert(0 <= to && to < n);
        internal.add_edge(from, to);
    }
    std::vector<std::vector<int>> scc() { return internal.scc(); }
  private:
    internal_scc::scc_graph internal;
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;
    cin >> T;
    while(T--){
        int n;
        cin >> n;
        vector<int> a(n), b(n);
        for(auto &&v : a) cin >> v, v--;
        for(auto &&v : b) cin >> v, v--;

        vector<vector<int>> g(n);
        vector<int> par(n, -1), depth(n);
        scc_graph g2(n);
        for(int i = 0; i < n; i++){
            if(a[i] != b[i]){
                g2.add_edge(i, a[i]);
                g[a[i]].emplace_back(i);
                par[i] = a[i];
            }
        }
        if(g2.scc().size() != n){
            cout << "No" << '\n';
            continue;
        }
        priority_queue<pair<int,int>> pq;
        vector<int> tmp;
        bool flag = true;
        function<void(int,int)> dfs = [&](int v, int p){
            depth[v] = tmp.size();
            if(p != -1){
                for(int j = tmp.size() - 1; j >= 0; j--){
                    if(tmp[j] == b[j]){
                        pq.emplace(j, v);
                        break;
                    }
                    if(j == 0){
                        flag = false;
                        break;
                    }
                }
            }
            tmp.emplace_back(a[v]);
            for(auto &&u : g[v]){
                if(u == p) continue;
                dfs(u, v);
            }
            tmp.pop_back();
        };
        for(int i = 0; i < n; i++){
            if(par[i] == -1) dfs(i, -1);
        }

        if(!flag){
            cout << "No" << '\n';
            continue;
        }

        vector<int> rute;
        while(!pq.empty()){
            int d, v, fr;
            tie(d, v) = pq.top();
            pq.pop();

            fr = v;
            while(v != -1){
                if(a[v] == b[fr]) break;
                rute.emplace_back(v);
                v = par[v];
            }

            if(v == -1){
                flag = false;
                break;
            }

            if(depth[v] == d){
                while(!rute.empty()){
                    a[rute.back()] = b[fr];
                    rute.pop_back();
                }
            }else{
                pq.emplace(depth[v], fr);
            }
        }

        if(!flag){
            cout << "No" << '\n';
            continue;
        }

        cout << (a == b ? "Yes" : "No") << '\n';
    }
}