#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;

template <typename T>
using maxheap = priority_queue<T>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

int pct(int x) { return __builtin_popcount(x); }
int pct(ll x) { return __builtin_popcountll(x); }
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename T>
void reorder(vector<T> &a, const vector<int> &ord) {
    int n = a.size();
    vector<T> b(n);
    for (int i = 0; i < n; i++) b[i] = a[ord[i]];
    swap(a, b);
}

template <typename T>
T floor(T x, T y) {
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return (x >= 0 ? x / y : (x - y + 1) / y);
}

template <typename T>
T ceil(T x, T y) {
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return (x >= 0 ? (x + y - 1) / y : x / y);
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

constexpr int inf = (1 << 30) - 1;
constexpr ll INF = (1LL << 60) - 1;
// constexpr int MOD = 1000000007;
constexpr int MOD = 998244353;

struct Union_Find_Tree {
    vector<int> data;
    const int n;
    int cnt;

    Union_Find_Tree(int n) : data(n, -1), n(n), cnt(n) {}

    int root(int x) {
        if (data[x] < 0) return x;
        return data[x] = root(data[x]);
    }

    int operator[](int i) { return root(i); }

    bool unite(int x, int y) {
        x = root(x), y = root(y);
        if (x == y) return false;
        if (data[x] > data[y]) swap(x, y);
        data[x] += data[y], data[y] = x;
        cnt--;
        return true;
    }

    int size(int x) { return -data[root(x)]; }

    int count() { return cnt; };

    bool same(int x, int y) { return root(x) == root(y); }

    void clear() {
        cnt = n;
        fill(begin(data), end(data), -1);
    }
};

void solve() {
    int N;
    cin >> N;

    vector<int> a1(N), a2(N);
    rep(i, N) cin >> a1[i], a1[i]--;
    rep(i, N) cin >> a2[i], a2[i]--;

    auto namori = [&](vector<int> a, int s) {
        vector<int> used(N, 0);
        int ptr = s;
        while (true) {
            if (used[ptr] == 2) break;
            used[ptr]++;
            ptr = a[ptr];
        }
        vector<int> ret;
        rep(i, N) {
            if (used[i] <= 1) continue;
            ptr = i;
            while (true) {
                ret.eb(ptr);
                ptr = a[ptr];
                if (ptr == i) break;
            }
            break;
        }
        return ret;
    };

    Union_Find_Tree uf1(N), uf2(N);
    rep(i, N) uf1.unite(i, a1[i]);
    rep(i, N) uf2.unite(i, a2[i]);

    vector<int> mi1(N, inf), mi2(N, inf);
    rep(i, N) chmin(mi1[uf1[i]], i);
    rep(i, N) chmin(mi2[uf2[i]], i);

    vector<vector<int>> c1(N), c2(N);
    rep(i, N) {
        if (uf1[i] == i) {
            int j = mi1[i];
            c1[j] = namori(a1, i);
        }
        if (uf2[i] == i) {
            int j = mi2[i];
            c2[j] = namori(a2, i);
        }
    }

    auto judge = [&](vector<int> t1, vector<int> t2) {
        int K = sz(t1), L = sz(t2);
        if (K < L) return false;
        if (K == 0 && L == 0) return true;
        if (L == 0) return false;
        rep(i, K) {
            if (t1[i] == t2[0]) {
                vector<int> tmp;
                rep(j, K) {
                    tmp.eb(t1[(i + j) % K]); //
                }
                int ptr = 0;
                each(e, t2) {
                    while (ptr < K && tmp[ptr] != e) ptr++;
                    if (ptr == K) return false;
                    ptr++;
                }
                return true;
            }
        }
        return false;
    };

    rep(i, N) {
        if (!judge(c1[i], c2[i])) {
            cout << "No\n";
            return;
        }
    }

    auto reachable = [&](int i, int j) {
        rep(_, N + 1) {
            if (i == j) return true;
            i = a1[i];
        }
        return false;
    };

    rep(i, N) {
        if (!reachable(i, a2[i])) {
            cout << "No\n";
            return;
        }
    }

    cout << "Yes\n";
}

int main() {
    int T = 1;
    cin >> T;
    while (T--) solve();
}