#include <bits/stdc++.h>
using namespace std;
void add_edge(vector<int> adj[], int u, int v) {
  adj[u - 1].push_back(v - 1);
  adj[v - 1].push_back(u - 1);
}
void dfs(vector<int> adj[], vector<int> &vis, vector<int> &d, int node) {
  vis[node] = 1;
  d.push_back(node);
  for (int i = 0; i < adj[node].size(); i++) {
    if (vis[adj[node][i]] != 1) {
      dfs(adj, vis, d, adj[node][i]);
    }
  }
}
int main() {
  int n;
  cin >> n;
  vector<int> v(n - 1);
  vector<int> adj[n];
  vector<int> vis(n, 0);
  for (int i = 1; i < n; i++) {
    int u;
    cin >> u;
    add_edge(adj, i + 1, u);
  }
  vector<int> c(n, 0);
  vector<int> d;
  for (int i = 0; i < n; i++) cin >> c[i];
  dfs(adj, vis, d, 0);
  int node = 0;
  long cnt = 1;
  for (int j = 0; j < d.size(); j++) {
    int node = d[j];
    if (j == 0) {
      for (int i = 0; i < adj[node].size(); i++) {
        if (c[node] != c[adj[node][i]]) cnt++;
      }
    } else {
      for (int i = 1; i < adj[node].size(); i++) {
        if (c[node] != c[adj[node][i]]) cnt++;
      }
    }
  }
  cout << "\n" << cnt;
  return 0;
}
