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