#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const int mod = 1e9 + 7;
inline int add(int x, int y) {
  x += y;
  if (x >= mod) return x - mod;
  return x;
}
inline int sub(int x, int y) {
  x -= y;
  if (x < 0) return x + mod;
  return x;
}
inline int mul(int x, int y) { return (x * 1ll * y) % mod; }
inline int power(int x, int y) {
  int ans = 1;
  while (y) {
    if (y & 1) ans = mul(ans, x);
    x = mul(x, x);
    y >>= 1;
  }
  return ans;
}
inline int inv(int x) { return power(x, mod - 2); }
const int N = 2e5 + 5;
vector<long long> v[N];
long long sz[N];
long long col[N];
long long p[N];
long long n;
long long dfs(long long i, long long pcol) {
  long long op = 0;
  if (pcol != col[i]) op++;
  for (auto it : v[i]) {
    op += dfs(it, col[i]);
  }
  return op;
}
void solve() {
  cin >> n;
  p[1] = 1;
  for (long long i = 2; i <= n; i++) {
    cin >> p[i];
    v[p[i]].push_back(i);
  }
  for (long long i = 1; i <= n; i++) {
    cin >> col[i];
  }
  cout << dfs(1, 0) << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  long long i = 1;
  while (t--) {
    solve();
    i++;
  }
  return 0;
}
