#include <bits/stdc++.h>
using namespace std;
int pre[10005];
int n;
int color[10005];
int c[10005];
vector<int> v[10005];
void dfs(int x, int y) {
  color[x] = y;
  for (int i = 0; i < v[x].size(); i++) {
    dfs(v[x][i], y);
  }
}
int main() {
  int cnt = 0;
  scanf("%d", &n);
  for (int i = 2; i <= n; i++) {
    scanf("%d", &pre[i]);
    v[pre[i]].push_back(i);
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d", &c[i]);
  }
  for (int i = 1; i <= n; i++) {
    if (color[i] != c[i]) {
      dfs(i, c[i]);
      cnt++;
    }
  }
  printf("%d\n", cnt);
}
