#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > a;
int n, ans = 1;
vector<int> c, was;
void dfs(int d, int t) {
  was[d] = t;
  for (int i = 0; i < a[d].size(); i++) {
    dfs(a[d][i], t);
  }
}
int main() {
  cin >> n;
  a.resize(n);
  for (int i = 1; i < n; i++) {
    int q;
    cin >> q;
    a[q - 1].push_back(i);
  }
  c.resize(n);
  for (int i = 0; i < n; i++) {
    cin >> c[i];
  }
  was.resize(n, c[0]);
  for (int i = 1; i < n; i++) {
    if (was[i] != c[i]) {
      dfs(i, c[i]);
      ans++;
    }
  }
  cout << ans;
  return 0;
}
