#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
inline int read() {
  int x = 0;
  int f = 0;
  char ch = 0;
  while (!isdigit(ch)) {
    f |= (ch == '-') ? 1 : 0;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = (x << 3) + (x << 1) + (ch ^ 48);
    ch = getchar();
  }
  return f ? -x : x;
}
const int INF = 1e9;
const int maxn = 3e5 + 10;
int aa[maxn], bb[maxn];
int vis[maxn];
int mn[maxn << 2];
queue<int> qq[maxn];
int n, t;
inline void build(int rt, int l, int r) {
  if (l == r) {
    mn[rt] = aa[l];
    return;
  }
  int mid = (l + r) >> 1;
  build(rt << 1, l, mid);
  build(rt << 1 | 1, mid + 1, r);
  mn[rt] = min(mn[rt << 1], mn[rt << 1 | 1]);
}
inline void update(int rt, int x, int al, int ar, int k) {
  if (x > ar || x < al) return;
  if (al == ar) {
    mn[rt] = k;
    return;
  }
  int mid = (al + ar) >> 1;
  update(rt << 1, x, al, mid, k);
  update(rt << 1 | 1, x, mid + 1, ar, k);
  mn[rt] = min(mn[rt << 1], mn[rt << 1 | 1]);
}
inline int query(int rt, int l, int r, int al, int ar) {
  if (l > ar || r < al) return INF;
  if (l <= al && r >= ar) return mn[rt];
  int mid = (al + ar) >> 1;
  return min(query(rt << 1, l, r, al, mid),
             query(rt << 1 | 1, l, r, mid + 1, ar));
}
int main() {
  t = read();
  while (t--) {
    n = read();
    for (register int i = 1; i <= n; ++i) vis[i] = 0;
    for (register int i = 1; i <= n; ++i) aa[i] = read(), ++vis[aa[i]];
    for (register int i = 1; i <= n; ++i) bb[i] = read(), --vis[bb[i]];
    int flag = 0;
    for (register int i = 1; i <= n; ++i)
      if (vis[i]) flag = 1;
    if (flag) {
      printf("NO\n");
      continue;
    }
    build(1, 1, n);
    for (register int i = 1; i <= n; ++i) {
      qq[aa[i]].push(i);
    }
    for (register int i = 1; i <= n; ++i) {
      int tmp = qq[bb[i]].front();
      qq[bb[i]].pop();
      int u = query(1, 1, tmp, 1, n);
      if (u < bb[i])
        flag = 1;
      else {
        update(1, tmp, 1, n, INF);
      }
    }
    if (flag)
      printf("NO\n");
    else
      printf("YES\n");
  }
}
