#include <bits/stdc++.h>
using namespace std;
int col[10005];
vector<int> adjlist[10005];
bool vis[10005];
int n, pi;
int u, cu;
int ans;
queue<pair<int, int> > bfq;
int main() {
  cin >> n;
  for (int i = 2; i <= n; i++) {
    cin >> pi;
    adjlist[pi].push_back(i);
    adjlist[i].push_back(pi);
  }
  for (int i = 1; i <= n; ++i) cin >> col[i];
  bfq.push({1, 0});
  while (!bfq.empty()) {
    u = bfq.front().first;
    cu = bfq.front().second;
    bfq.pop();
    vis[u] = true;
    if (cu != col[u]) {
      ++ans;
    }
    for (int v : adjlist[u]) {
      if (!vis[v]) bfq.push({v, col[u]});
    }
  }
  cout << ans << '\n';
  return 0;
}
