#include<bits/stdc++.h>
using namespace std;
#define int long long 
const int NN=998244353;
int a[300300],b[300300],c[600600];
int aa[300300],bb[300300];
int f[300300][2],g[300300][2];
vector<int>d[300300];
int n,col[300300];
void solve(){
	cin>>n;
	for (int i=1;i<=n;i++)d[i].clear();
	for (int i=1;i<=n;i++)
	cin>>a[i],aa[a[i]]=i;aa[n+1]=n+1;a[n+1]=n+1;
	for (int i=1;i<=n;i++)
	cin>>b[i],bb[b[i]]=i;bb[n+1]=n+1;b[n+1]=n+1;
	for (int i=1;i<=2*n;i++)
	cin>>c[i],d[c[i]].push_back(i),f[i][0]=f[i][1]=g[i][0]=g[i][1]=0;
	d[n+1].push_back(2*n+1);
	f[2*n+1][0]=1,f[2*n+1][1]=1;g[2*n+1][0]=n+1,g[2*n+1][1]=n+1;
	for (int i=2*n;i;i--){
		for (auto j:d[a[aa[c[i]]+1]])
		if(j>i){
			int t2=g[j][0],fl=1;
			for (int k=j-1;k>i;k--)
			if(b[bb[t2]-1]==c[k])t2=c[k];
			else {fl=0;break;}
			if(fl==1)f[i][0]=(f[i][0]+f[j][0])%NN,g[i][0]=t2;
		}
		for (auto j:d[b[bb[c[i]]+1]])
		if(j>i){
			int t2=g[j][1],fl=1;
			for (int k=j-1;k>i;k--)
			if(a[aa[t2]-1]==c[k])t2=c[k];
			else {fl=0;break;}
			if(fl==1)f[i][1]=(f[i][1]+f[j][1])%NN,g[i][1]=t2;
		}
	}
	cout<<(f[1][0]+f[1][1])%NN<<"\n";
}
signed main(){
	int T;cin>>T;
	while(T--)solve();
}