#include <bits/stdc++.h>
using namespace std;
int n, m, k, i, j, pas;
int fix[100001];
int col[100001];
vector<int> g[100001];
void dfs(int v, int p, int color) {
  if (col[v] != color) {
    pas++;
  }
  for (int j = 0; j < g[v].size(); j++) {
    if (g[v][j] != p) {
      dfs(g[v][j], v, col[v]);
    }
  }
}
int main() {
  int a;
  cin >> n;
  for (int i = 2; i <= n; i++) {
    scanf("%d", &a);
    g[i].push_back(a);
    g[a].push_back(i);
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d", &col[i]);
  }
  dfs(1, 0, -1);
  cout << pas;
}
