#include <cstdio>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <iostream>

#define mp make_pair
#define pb push_back
#define xx first
#define yy second

using namespace std;

int a[100005], b[100005], in[100005];
bool vis[100005];

main() {
  int T, i, n, m, p, s, x;

  scanf("%d",&T);
  while(T--){
    scanf("%d",&n);
    for (i = 0; i < n; i++) {
      scanf("%d",&a[i]);
      in[a[i]] = i;
    }
    
    for (i = 0; i < n; i++)
      scanf("%d",&b[i]);
    
    memset(vis, 0, sizeof vis);
    
    s = 0;
    for (i = 0; i < n; i++)
      if (!vis[a[i]]) {
    x = a[i];
    while (vis[x] == 0) {
      vis[x] = 1;
      x = b[in[x]];
      s++;
    }
    
    if (x != b[in[x]])
      s--;
      }
    
    printf("%d\n", s);
  }
  return 0;
}