import sys

# sys.setrecursionlimit(1000005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

class SparseTable:
    def __init__(self, op, e, aa):
        self.op = op
        self.e = e
        self.w = w = len(aa)
        self.h = h = w.bit_length()
        table = [aa]+[[e() for _ in range(w)] for _ in range(h-1)]
        tablei1 = table[0]
        for i in range(1, h):
            tablei = table[i]
            for j in range(w-(1 << i)+1):
                rj = j+(1 << (i-1))
                tablei[j] = op(tablei1[j], tablei1[rj])
            tablei1 = tablei
        self.table = table

    # [l,r)の取得
    def prod(self, l, r):
        if l == r: return self.e()
        i = (r-l).bit_length()-1
        tablei = self.table[i]
        return self.op(tablei[l], tablei[r-(1 << i)])

from bisect import bisect

def ok():
    n = II()
    aa = LI()
    bb = LI()
    amx = SparseTable(max, lambda: -1, aa)
    bmn = SparseTable(min, lambda: inf, bb)
    a2i = [[] for _ in range(n+1)]
    for i, a in enumerate(aa): a2i[a].append(i)
    for j, b in enumerate(bb):
        if b == aa[j]: continue
        if b < aa[j]: return False
        ng = 1
        ii = a2i[b]
        p = bisect(ii, j)
        if p < len(ii):
            i = ii[p]
            if amx.prod(j, i) <= b and bmn.prod(j, i) >= b: ng = 0
        if p:
            i = ii[p-1]
            if amx.prod(i, j) <= b and bmn.prod(i, j) >= b: ng = 0
        if ng: return False
    return True

for _ in range(II()): print("Yes" if ok() else "No")