#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 1e5 + 7;
vector<long long> g[MAXN];
long long col[MAXN], res;
void dfs(long long v, long long p, long long c) {
  if (c != col[v]) c = col[v], res++;
  for (auto u : g[v])
    if (u != p) dfs(u, v, c);
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  for (long long i = 2; i <= n; i++) {
    long long p;
    cin >> p;
    g[i].push_back(p);
    g[p].push_back(i);
  }
  for (long long i = 1; i <= n; i++) cin >> col[i];
  dfs(1, -1, 0);
  cout << res;
}
