#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) { a = max(a, b); }
template<class T> void chmin(T& a, const T& b) { a = min(a, b); }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

constexpr int INF = 1001001001;
int op(int x, int y) {
  return max(x, y);
}
int e() { return -INF; }

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while(tt--) {
    int n;
    cin >> n;
    VI a(n), b(n);
    rep(i, n) cin >> a[i], a[i]--;
    rep(i, n) cin >> b[i], b[i]--;
    segtree<int, op, e> seg(a);
    VVI d(n);
    rep(i, n) d[b[i]].push_back(i);
    bool ok = true;
    rep(x, n) {
      for(int i: d[x]) {
        int il = seg.min_left(i + 1, [&](int m) {
          return m <= x;
        });
        if (seg.prod(il, i + 1) == x) continue;
        int ir = seg.max_right(i, [&](int m) {
          return m <= x;
        });
        if (seg.prod(i, ir) == x) continue;
        ok = false;
        break;
      }
      if (!ok) break;
      for(int i: d[x]) seg.set(i, INF);
    }
    cout << (ok ? "Yes\n" : "No\n");
  }
}