#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > g;
vector<int> want;
long long ans = 0;
void dfs(int v, int col) {
  if (col != want[v]) {
    ans++;
  }
  for (auto u : g[v]) {
    dfs(u, want[v]);
  }
  return;
}
int main() {
  int n;
  cin >> n;
  g.resize(n);
  want.resize(n);
  for (int i = 1; i < n; i++) {
    int p;
    cin >> p;
    g[p - 1].push_back(i);
  }
  for (int i = 0; i < n; i++) {
    cin >> want[i];
  }
  dfs(0, 0);
  cout << ans;
}
