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)); }




void main() {
  try {
    for (; ; ) {
      const numCases = readInt();
      foreach (caseId; 0 .. numCases) {
        const N = readInt();
        auto A = new int[N]; foreach (i; 0 .. N) A[i] = readInt();
        auto B = new int[N]; foreach (i; 0 .. N) B[i] = readInt();
        
        auto iss = new int[][N + 1];
        auto jss = new int[][N + 1];
        foreach (i; 0 .. N) {
          iss[A[i]] ~= i;
          jss[B[i]] ~= i;
        }
        auto set = new RedBlackTree!int;
        set.insert(-1);
        set.insert(N);
        auto ls = new int[N];
        auto rs = new int[N];
        foreach (a; 1 .. N + 1) {
          foreach (i; iss[a]) {
            ls[i] = set.lowerBound(i).back + 1;
            rs[i] = set.upperBound(i).front - 1;
          }
          foreach (i; jss[a]) {
            set.insert(i);
          }
        }
        debug {
          writeln("ls = ", ls);
          writeln("rs = ", rs);
        }
        
        bool ans = true;
        foreach (i; 0 .. N) {
          ans = ans && (A[i] <= B[i]);
        }
        {
          int j;
          foreach (i; 0 .. N) {
            for (; j < N && (A[i] == B[j] && ls[i] <= j && j <= rs[i]); ++j) {}
          }
          ans = ans && (j == N);
        }
        writeln(ans ? "Yes" : "No");
      }
    }
  } catch (EOFException e) {
  }
}