#include <bits/stdc++.h>
using namespace std;

vector<int> g[1005], b[1005];
int fa[1005], c[1005], in[1005];
bool vis[1005], h[1005];

struct edge
{
	int v, next;
}e[2000005];
int head[1005], tot;

inline void addedge(int u, int v)
{
	e[++tot] = (edge){v, head[u]};
	head[u] = tot;
}

bool findcir(int u)
{
	vis[u] = 1;
	for (int v : g[u]) if (vis[v] || !findcir(v)) return false;
	return true;
}

bool dfs(int u, int F)
{
	if (fa[u] == c[u] && u != F && fa[fa[u]] != fa[u]) h[u] = false;
	else
	{
		h[u] = true;
		if (F != c[u])
		{
			addedge(F, c[u]);
			addedge(c[u], F);
			b[c[u]].emplace_back(F);
			in[F]++;
		}
	}
	for (int v : g[u])
	{
		if (!dfs(v, F)) return false;
		if (!h[u] && h[v]) return false;
	}
	return true;
}

int C[1005];
bool color(int u, int col)
{
	if (C[u] && C[u] != col) return false;
	else if (C[u] == col) return true;
	C[u] = col;
	for (int i = head[u]; i; i = e[i].next)
	{
		int v = e[i].v;
		if (!color(v, col)) return false;
	}
	return true;
}

bool rem[1005];
int op[2000005][3];
int ans[1005][1005], siz[1005];

bool Topo(int u, int i)
{
	if (in[u]) return false;
	queue<int> q;
	q.push(u);
	while (q.size())
	{
		int u = q.front(); q.pop();
		ans[i][++siz[i]] = u;
		for (int v : b[u])
			if (--in[v] == 0) q.push(v);
	}
	return true;
}

bool work()
{
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) siz[i] = head[i] = in[i] = C[i] = vis[i] = h[i] = 0, b[i].clear(), g[i].clear();
	tot = 0;
	for (int i = 1; i <= n; i++)
	{
		cin >> fa[i];
		if (fa[i] != i) g[fa[i]].emplace_back(i);
	}
	int dot = 0, K = 0;
	for (int i = 1; i <= n; i++) cin >> c[i];
	for (int i = 1; i <= n; i++) if ((fa[i] != i) && (c[i] == i)) return false;
	for (int i = 1; i <= n; i++) if (fa[i] == i && !findcir(i)) return false;
	for (int i = 1; i <= n; i++) if (fa[i] == i && !dfs(i, i)) return false;
	for (int i = 1; i <= n; i++) if (c[i] == i && !color(i, i)) return false;
	for (int i = 1; i <= n; i++) if (c[i] == i && !Topo(i, ++dot)) return false;
	for (int i = 1; i <= n; i++) if (fa[i] == i && in[i]) return false;
	cout << "YES\n";
	for (int i = 1; i <= dot; i++)
	{
		for (int j = 1; j <= siz[i]; j++) rem[ans[i][j]] = 1;
		for (int j = siz[i]; j; j--)
		{
			for (int u = 1; u <= n; u++)
				if (rem[c[u]] && fa[fa[u]] != fa[u]) op[++K][0] = 1, op[K][1] = u;
			if (j > 1) op[++K][0] = 2, op[K][1] = ans[i][j], op[K][2] = ans[i][j - 1], fa[ans[i][j]] = ans[i][j - 1];
			rem[ans[i][j]] = 0;
		}
	}
	cout << K << "\n";
	for (int i = 1; i <= K; i++)
	{
		if (op[i][0] == 1) cout << "1 " << op[i][1] << "\n";
		else cout << "2 " << op[i][1] << " " << op[i][2] << "\n";
	}
	return true;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	int T;
	cin >> T;
	while (T--) if (!work()) cout << "NO\n";
	return 0;
}