#include <cstdio>
#include <algorithm>
using namespace std;

const int N = 100005;

int a[N], b[N], f[N], vis[N];

void solve()
{
    int n;
    scanf("%d", &n);
    for (int i=0; i<n; ++i) {
        scanf("%d", &a[i]);
        f[a[i]] = i;
    }
    for (int i=0; i<n; ++i) {
        scanf("%d", &b[i]);
    }
    memset(vis, 0, sizeof(vis));
    int ans=0;
    for (int i=0; i<n; ++i) {
        if (vis[i]) {
            continue;
        }
        if (a[i] == b[i]) {
            ++ans;
            vis[i] = 1;
            continue;
        }
        int cnt=0, t=a[i], x=b[i];
        vis[i] = 1;
        while (x != t) {
            ++cnt;
            int p=f[x];
            vis[p] = 1;
            x = b[p];
        }
        ans += cnt;
    }
    printf("%d\n", ans);
}

int main()
{
    int n;
    scanf("%d", &n);
    for (int i=0; i<n; ++i) {
        solve();
    }
    return 0;
}