#include <bits/stdc++.h>
using namespace std;
vector<int> v[10010];
int c[10010] = {};
int ok[10010] = {};
long long ans = 1;
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n - 1; i++) {
    int u;
    scanf("%d", &u);
    v[u].push_back(i + 2);
  }
  for (int i = 1; i <= n; i++) {
    int a;
    scanf("%d", &a);
    c[i] = a;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < v[i].size(); j++) {
      if (c[i] != c[v[i][j]]) ans++;
    }
  }
  cout << ans;
  return 0;
}
