#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<int> v(n + 1, -1);
  vector<vector<int>> go(n + 1);
  for (int i = 2; i <= n; i++) {
    cin >> v[i];
    go[v[i]].push_back(i);
  }
  vector<int> col(n + 1, -1);
  vector<int> r(n + 1, -1);
  for (int i = 1; i <= n; i++) {
    cin >> col[i];
  }
  long long c = 0;
  queue<int> q;
  for (int i = 1; i <= n; i++) {
    if (r[i] != col[i]) {
      q.push(i);
      c++;
      for (int j = i; j <= n && q.size() > 0;) {
        j = q.front();
        q.pop();
        r[j] = col[i];
        if (go[j].size() > 0) {
          for (int k = 0; k < go[j].size(); k++) {
            q.push(go[j][k]);
          }
        } else
          continue;
      }
    }
  }
  cout << c;
}
