#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct qq{
    int x,y;
    bool operator < (const qq &X) const{
        return x<X.x;
    }
}a[100100];
int T,n,i,tem,j;
bool v[100100];
int main(){
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        for(i=1;i<=n;++i){
            scanf("%d",&a[i].x);
        }
        for(i=1;i<=n;++i){
            scanf("%d",&a[i].y);
        }
        sort(a+1,a+n+1);
        tem=n;
        memset(v,0,sizeof(v));
        for(i=1;i<=n;++i){
            if(v[i])continue;
            if(a[i].x==a[i].y)continue;
            v[i]=1;
            for(j=a[i].y;j!=i;j=a[j].y){
                v[j]=1;
            }
            tem--;
        }
        printf("%d\n",tem);
    }
}