import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N;
int[] A, B;

bool solve() {
  foreach (u; 0 .. N) {
    auto vis = new bool[N];
    bool ok;
    for (int v = u; ; ) {
      v = A[v];
      if (vis[v]) break;
      vis[v] = true;
      ok = ok || (B[u] == v);
    }
    if (!ok) {
      debug {
        writeln("impossible B[u] for u = ", u);
      }
      return false;
    }
  }
  
  {
    auto ids = new int[N];
    ids[] = -1;
    auto vis = new int[N];
    vis[] = -1;
    foreach (u; 0 .. N) {
      int v;
      for (v = u; !~vis[v]; v = A[v]) {
        vis[v] = u;
      }
      if (vis[v] == u) {
        int[] cyc;
        for (int w = v; ; ) {
          cyc ~= w;
          if ((w = A[w]) == v) break;
        }
        const cycLen = cast(int)(cyc.length);
        debug {
          writeln("cyc = ", cyc);
        }
        foreach (j; 0 .. cycLen) {
          ids[cyc[j]] = j;
        }
        auto visB = new int[cycLen];
        visB[] = -1;
        int cnt;
        foreach (j; 0 .. cycLen) {
          int k;
          for (k = j; !~visB[k]; k = ids[B[cyc[k]]]) {
            visB[k] = j;
          }
          if (visB[k] == j) {
            if (++cnt >= 2) {
              return false;
            }
            int[] cycB;
            for (int l = k; ; ) {
              cycB ~= l;
              if ((l = ids[B[cyc[l]]]) == k) break;
            }
            const cycBLen = cast(int)(cycB.length);
            const h0 = cycB.minIndex;
            cycB = cycB[h0 .. $] ~ cycB[0 .. h0];
            debug {
              writeln("  cycB = ", cycB);
            }
            foreach (h; 0 .. cycBLen - 1) {
              if (!(cycB[h] < cycB[h + 1])) {
                return false;
              }
            }
          }
        }
      }
    }
  }
  
  return true;
}

void main() {
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        N = readInt;
        A = new int[N];
        B = new int[N];
        foreach (u; 0 .. N) A[u] = readInt - 1;
        foreach (u; 0 .. N) B[u] = readInt - 1;
        
        const ans = solve;
        writeln(ans ? "Yes" : "No");
      }
    }
  } catch (EOFException e) {
  }
}