#include <bits/stdc++.h>
using namespace std;
list<int> adj[20007];
bool vis[20007];
int col[20007];
int bfs(int u) {
  int cnt = 0;
  queue<pair<int, int> > q;
  q.push(make_pair(u, 0));
  while (!q.empty()) {
    pair<int, int> p;
    p = q.front();
    q.pop();
    int x = p.first;
    int y = p.second;
    vis[x] = true;
    if (col[x] != y) cnt += 1;
    list<int>::iterator it;
    for (it = adj[x].begin(); it != adj[x].end(); it++) {
      if (!vis[*it]) q.push(make_pair(*it, col[x]));
    }
  }
  return cnt;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  memset(vis, false, sizeof(vis));
  int n;
  cin >> n;
  for (int i = 0; i < n - 1; i++) {
    int tmp;
    cin >> tmp;
    adj[i + 1].push_back(tmp - 1);
    adj[tmp - 1].push_back(i + 1);
  }
  for (int i = 0; i < n; i++) cin >> col[i];
  int res = bfs(0);
  cout << res << endl;
  return 0;
}
