#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long int arr[N];
long long int brr[N];
vector<int> v[N];
int level[N];
int vis[N];
int c[N];
int ans;
int color[N];
int pre = 0;
void bfs(int s) {
  queue<int> q;
  q.push(s);
  vis[s] = 1;
  ans++;
  pre = 1;
  while (!q.empty()) {
    int p = q.front();
    q.pop();
    pre = c[p];
    for (int i = 0; i < v[p].size(); i++) {
      if (vis[v[p][i]] == 0) {
        q.push(v[p][i]);
        color[v[p][i]] = pre;
        if (pre != c[v[p][i]]) ans++;
        vis[v[p][i]] = 1;
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  ans = 0;
  for (int i = 2; i <= n; i++) {
    int x;
    cin >> x;
    v[i].push_back(x);
    v[x].push_back(i);
  }
  for (int i = 1; i <= n; i++) cin >> c[i];
  memset(vis, 0, sizeof(vis));
  memset(color, 0, sizeof(color));
  bfs(1);
  cout << ans << endl;
  return 0;
}
