#include <bits/stdc++.h>
using namespace std;
vector<long long int> ve[100005];
long long int col[100005];
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n;
  cin >> n;
  for (long long int i = 1; i <= n - 1; i++) {
    long long int p;
    cin >> p;
    ve[p].push_back(i + 1);
  }
  for (long long int i = 1; i <= n; i++) {
    cin >> col[i];
  }
  queue<pair<long long int, long long int>> q;
  q.push({1, col[1]});
  long long int re = 1;
  while (!q.empty()) {
    long long int x = q.front().first;
    long long int c = q.front().second;
    q.pop();
    for (auto it : ve[x]) {
      if (col[it] != c) re++;
      q.push({it, col[it]});
    }
  }
  cout << re << endl;
  return 0;
}
