#include <bits/stdc++.h>
using namespace std;
vector<int> adj[100005];
int visited[100005];
int arr[100005];
int v[100005];
void dfs(int x, int c) {
  for (int i = 0; i < adj[x].size(); i++) {
    if (visited[adj[x][i]] != c) {
      visited[adj[x][i]] = c;
      dfs(adj[x][i], c);
    }
  }
}
int main() {
  int n;
  cin >> n;
  int x;
  memset(visited, 0, sizeof(visited));
  for (int i = 2; i <= n; i++) {
    cin >> x;
    adj[x].push_back(i);
  }
  for (int i = 1; i <= n; i++) {
    cin >> arr[i];
  }
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    if (visited[i] != arr[i]) {
      visited[i] = arr[i];
      ans++;
      dfs(i, arr[i]);
    }
  }
  cout << ans;
  return 0;
}
