#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


// fast IO by yosupo
// sc.read(string &) appends the input
struct Scanner {
    FILE* fp = nullptr;
    char line[(1 << 15) + 1];
    size_t st = 0, ed = 0;
    void reread() {
        memmove(line, line + st, ed - st);
        ed -= st;
        st = 0;
        ed += fread(line + ed, 1, (1 << 15) - ed, fp);
        line[ed] = '\0';
    }
    bool succ() {
        while (true) {
            if (st == ed) {
                reread();
                if (st == ed) return false;
            }
            while (st != ed && isspace(line[st])) st++;
            if (st != ed) break;
        }
        if (ed - st <= 50) reread();
        return true;
    }
    template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
    bool read_single(T& ref) {
        if (!succ()) return false;
        while (true) {
            size_t sz = 0;
            while (st + sz < ed && !isspace(line[st + sz])) sz++;
            ref.append(line + st, sz);
            st += sz;
            if (!sz || st != ed) break;
            reread();            
        }
        return true;
    }
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    bool read_single(T& ref) {
        if (!succ()) return false;
        bool neg = false;
        if (line[st] == '-') {
            neg = true;
            st++;
        }
        ref = T(0);
        while (isdigit(line[st])) {
            ref = 10 * ref + (line[st++] - '0');
        }
        if (neg) ref = -ref;
        return true;
    }
    template <class T> bool read_single(vector<T>& ref) {
        for (auto& d : ref) {
            if (!read_single(d)) return false;
        }
        return true;
    }
    void read() {}
    template <class H, class... T> void read(H& h, T&... t) {
        bool f = read_single(h);
        assert(f);
        read(t...);
    }
    Scanner(FILE* _fp) : fp(_fp) {}
};

struct Printer {
  public:
    template <bool F = false> void write() {}
    template <bool F = false, class H, class... T>
    void write(const H& h, const T&... t) {
        if (F) write_single(' ');
        write_single(h);
        write<true>(t...);
    }
    template <class... T> void writeln(const T&... t) {
        write(t...);
        write_single('\n');
    }

    Printer(FILE* _fp) : fp(_fp) {}
    ~Printer() { flush(); }

  private:
    static constexpr size_t SIZE = 1 << 15;
    FILE* fp;
    char line[SIZE], small[50];
    size_t pos = 0;
    void flush() {
        fwrite(line, 1, pos, fp);
        pos = 0;
    }
    void write_single(const char& val) {
        if (pos == SIZE) flush();
        line[pos++] = val;
    }
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    void write_single(T val) {
        if (pos > (1 << 15) - 50) flush();
        if (val == 0) {
            write_single('0');
            return;
        }
        if (val < 0) {
            write_single('-');
            val = -val;  // todo min
        }
        size_t len = 0;
        while (val) {
            small[len++] = char('0' + (val % 10));
            val /= 10;
        }
        for (size_t i = 0; i < len; i++) {
            line[pos + i] = small[len - 1 - i];
        }
        pos += len;
    }
    void write_single(const string& s) {
        for (char c : s) write_single(c);
    }
    void write_single(const char* s) {
        size_t len = strlen(s);
        for (size_t i = 0; i < len; i++) write_single(s[i]);
    }
    template <class T> void write_single(const vector<T>& val) {
        auto n = val.size();
        for (size_t i = 0; i < n; i++) {
            if (i) write_single(' ');
            write_single(val[i]);
        }
    }
    void write_single(long double d){
		{
			long long v=d;
			write_single(v);
			d-=v;
		}
		write_single('.');
		for(int _=0;_<8;_++){
			d*=10;
			long long v=d;
			write_single(v);
			d-=v;
		}
    }
};

Scanner sc(stdin);
Printer pr(stdout);


struct Functional {
  int n;
  vector<int> par;
  int cyclesLen;
  vector<vector<int>> cycles;
  // cycle id or -1
  vector<int> on;
  // tree
  vector<vector<int>> graph;
  // root
  vector<int> rs;
  Functional() {}
  Functional(const vector<int> &par_) : par(par_) {
    n = par.size();
    cycles.clear();
    vector<int> vis(n, -1);
    for (int s = 0; s < n; ++s) {
      int u = s;
      for (; !~vis[u]; u = par[u]) {
        vis[u] = s;
      }
      if (vis[u] == s) {
        vector<int> cycle;
        for (int v = u; ; ) {
          cycle.push_back(v);
          if ((v = par[v]) == u) break;
        }
        cycles.push_back(cycle);
      }
    }
    cyclesLen = cycles.size();
    on.assign(n, -1);
    for (int k = 0; k < cyclesLen; ++k) {
      for (const int u : cycles[k]) {
        on[u] = k;
      }
    }
    graph.assign(n, {});
    for (int u = 0; u < n; ++u) if (!~on[u]) {
      graph[par[u]].push_back(u);
    }
    rs.assign(n, -1);
    for (int u = 0; u < n; ++u) if (~on[u]) {
      dfs(u, u);
    }
  }
  void dfs(int u, int r) {
    rs[u] = r;
    for (const int v : graph[u]) {
      dfs(v, u);
    }
  }
};


int root(vector<int> &uf, int u) {
  // return (uf[u] < 0) ? u : (uf[u] = root(uf, uf[u]));
  return (uf[u] == u) ? u : (uf[u] = root(uf, uf[u]));
}
bool connect(vector<int> &uf, int u, int v) {
  u = root(uf, u);
  v = root(uf, v);
  if (u == v) return false;
  // if (uf[u] > uf[v]) swap(u, v);
  // uf[u] += uf[v];
  // uf[v] = u;
  uf[u] = v;
  return true;
}


int N;
vector<int> F, G;

vector<vector<int>> graph;
vector<int> vis;
int zeit;
vector<int> ord;
bool dfs(int u) {
  vis[u] = 1;
  for (const int v : graph[u]) if (u != v) {
    if (vis[v] == 0) {
      if (!dfs(v)) {
        return false;
      }
    } else if (vis[v] == 1) {
      return false;
    } else {
      //
    }
  }
  vis[u] = 2;
  ord[u] = --zeit;
  return true;
}

bool solve() {
  // G is tree?
  const auto gunc = Functional(G);
  for (const auto &cycle : gunc.cycles) {
    if (cycle.size() > 1) {
      return false;
    }
  }
  
  auto fs = F;
  auto gs = G;
  vector<int> RF(N), RG(N);
  for (int u = 0; u < N; ++u) {
    RF[u] = root(fs, u);
    RG[u] = root(gs, u);
  }
  
  vector<vector<int>> uss(N);
  for (int u = 0; u < N; ++u) {
    uss[RF[u]].push_back(u);
  }
  for (int r = 0; r < N; ++r) if (F[r] == r) {
    for (const int u : uss[r]) {
      if (RG[r] != RG[u]) {
        return false;
      }
    }
  }
  vector<vector<int>> rss(N);
  for (int r = 0; r < N; ++r) if (F[r] == r) {
    rss[RG[r]].push_back(r);
  }
// cerr<<"uss = "<<uss<<endl;
// cerr<<"rss = "<<rss<<endl;
  
  // is original root
  auto isR = [&](int u) -> bool {
    return (F[u] == u);
  };
  graph.assign(N, {});
  for (int u = 0; u < N; ++u) {
    if (F[u] != G[u]) {
      if (!isR(G[u])) {
        return false;
      }
      const int p = F[u];
      if (F[p] == G[p] && !isR(G[p])) {
        return false;
      }
      // condition
      graph[RF[u]].push_back(G[u]);
    }
  }
  
  for (int q = 0; q < N; ++q) if (G[q] == q) {
    // global root
    for (const int r : rss[q]) {
      graph[r].push_back(q);
    }
  }
// cerr<<"graph = "<<graph<<endl;
  
  vis.assign(N, 0);
  zeit = N;
  ord.assign(N, -1);
  for (int u = 0; u < N; ++u) if (vis[u] == 0) {
    if (!dfs(u)) {
      return false;
    }
  }
  
  auto judge = F;
  vector<pair<int, int>> ans;
  auto Find = [&](int u) -> void {
    ans.emplace_back(u, -1);
    root(judge, u);
  };
  auto Unite = [&](int u, int v) -> void {
    ans.emplace_back(u, v);
    connect(judge, u, v);
  };
  
  for (int q = 0; q < N; ++q) if (G[q] == q) {
    auto &rs = rss[q];
    sort(rs.begin(), rs.end(), [&](int r0, int r1) -> bool {
      return (ord[r0] < ord[r1]);
    });
// cerr<<"rs = "<<rs<<endl;
    const int rsLen = rs.size();
    for (int j = 0; j < rsLen; ++j) {
      if (j) {
        Unite(rs[j - 1], rs[j]);
      }
      for (int i = 0; i <= j; ++i) {
        for (const int u : uss[rs[i]]) {
          if (G[u] != judge[u]) {
            Find(u);
          }
        }
      }
    }
  }
// cerr<<"ans = "<<ans<<endl;
// cerr<<"judge = "<<judge<<endl;
  assert(G == judge);
  
  pr.writeln("YES");
  pr.writeln(ans.size());
  for (const auto &op : ans) {
    if (!~op.second) {
      pr.writeln(1, op.first + 1);
    } else {
      pr.writeln(2, op.first + 1, op.second + 1);
    }
  }
  return true;
}

int main() {
  int numCases; sc.read(numCases); for (int caseId = 1; caseId <= numCases; ++caseId) {
    sc.read(N);
    F.resize(N); for (int u = 0; u < N; ++u) { sc.read(F[u]); --F[u]; }
    G.resize(N); for (int u = 0; u < N; ++u) { sc.read(G[u]); --G[u]; }
    
    const bool res = solve();
    if (!res) {
      pr.writeln("NO");
    }
  }
  return 0;
}