#include <bits/stdc++.h>
using namespace std;
int _I() {
  int x;
  scanf("%d", &x);
  return x;
}
vector<int> g[10001];
int vis[10001];
int color[10001];
void dfs(int u, int c) {
  vis[u] = c;
  int sz = g[u].size();
  for (int i = 0; i < sz; i++) {
    if (vis[g[u][i]] != c) dfs(g[u][i], c);
  }
}
int main() {
  int n = _I();
  for (int i = 2; i <= n; i++) {
    int x = _I();
    g[x].push_back(i);
  }
  memset(vis, 0, sizeof(vis));
  for (int i = 1; i <= n; i++) {
    int x = _I();
    color[i] = x;
  }
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    if (vis[i] != color[i]) {
      ans++;
      dfs(i, color[i]);
    }
  }
  printf("%d\n", ans);
  return 0;
}
