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