#include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long int> a[100005], col(100005, 0);
long long ans = 0;
void dfs(long long node, long long par, long long cur) {
  if (col[node] != cur) ans++;
  for (auto i : a[node])
    if (i != par) dfs(i, node, col[node]);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int TESTS = 1;
  while (TESTS--) {
    cin >> n;
    for (long long int i = 2; i < n + 1; i++) {
      long long x;
      cin >> x;
      a[i].push_back(x);
      a[x].push_back(i);
    }
    for (long long int i = 1; i < n + 1; i++) cin >> col[i];
    dfs(1, -1, -1);
    cout << ans;
  }
  return 0;
}
