#include <bits/stdc++.h>
using namespace std;
const int NMAX = 10005;
vector<int> v[NMAX];
int s[NMAX];
int color[NMAX];
int pcolor[NMAX];
queue<int> q;
void bfs(int i) {
  q.push(i);
  while (!q.empty()) {
    int nod = q.front();
    for (auto it : v[nod]) {
      q.push(it);
    }
    s[++s[0]] = nod;
    q.pop();
  }
}
void change(int i, int nr) {
  color[i] = nr;
  for (auto it : v[i]) {
    change(it, nr);
  }
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 2; i <= n; ++i) {
    int x;
    scanf("%d", &x);
    v[x].push_back(i);
  }
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &pcolor[i]);
  }
  bfs(1);
  int sol = 0;
  for (int i = 1; i <= n; ++i) {
    if (color[s[i]] != pcolor[s[i]]) {
      ++sol;
      change(s[i], pcolor[s[i]]);
    }
  }
  printf("%d\n", sol);
  return 0;
}
