#include <bits/stdc++.h>
using namespace std;
const int maxn = 10000 + 5;
vector<int> ans[maxn];
int color[maxn], cnt[maxn];
void dfs(int n, int c) {
  int len = ans[n].size();
  cnt[n] = c;
  for (int i = 0; i < len; ++i) dfs(ans[n][i], c);
}
int main() {
  int N, x, t = 0;
  cin >> N;
  for (int i = 2; i <= N; ++i) {
    cin >> x;
    int a = max(i, x), b = min(i, x);
    ans[b].push_back(a);
  }
  for (int i = 1; i <= N; ++i) cin >> color[i];
  for (int i = 1; i <= N; ++i) {
    if (cnt[i] != color[i]) {
      t++;
      dfs(i, color[i]);
    }
  }
  cout << t << endl;
  return 0;
}
