#include <bits/stdc++.h>
using namespace std;
struct nodo {
  int l, r, v;
};
const int MAX = 3e5 + 10;
int a[MAX];
int b[MAX];
nodo s[4 * MAX];
void build(int i, int l, int r) {
  s[i].l = l;
  s[i].r = r;
  if (l == r) {
    s[i].v = a[l];
    return;
  }
  int c = (l + r) / 2;
  build(2 * i, l, c);
  build(2 * i + 1, c + 1, r);
  s[i].v = min(s[2 * i].v, s[2 * i + 1].v);
}
void change(int i, int p, int v) {
  int L = s[i].l, R = s[i].r;
  int C = (L + R) / 2;
  if (L == R) {
    s[i].v = v;
    a[p] = v;
    return;
  }
  if (p <= C)
    change(2 * i, p, v);
  else
    change(2 * i + 1, p, v);
  s[i].v = min(s[2 * i].v, s[2 * i + 1].v);
}
int find(int x) {
  int curr = 1;
  while (s[curr].l != s[curr].r) {
    if (s[curr].v > x) return 0;
    if (s[2 * curr].v <= x) {
      curr = 2 * curr;
      continue;
    }
    curr = 2 * curr + 1;
  }
  if (s[curr].v == x) return s[curr].l;
  return 0;
}
void solve() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d", &b[i]);
  }
  build(1, 1, n);
  for (int i = 1; i <= n; i++) {
    if (b[i] == MAX) continue;
    int pos = find(b[i]);
    if (pos == 0) {
      printf("NO\n");
      return;
    }
    change(1, pos, MAX);
    b[i] = MAX;
  }
  printf("YES\n");
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    solve();
  }
}
