#include <bits/stdc++.h>
using namespace std;
void dfs(int start, vector<vector<int>>& mas, vector<bool>& used, int& count,
         vector<int>& color) {
  used[start] = true;
  for (int i = 0; i < mas[start].size(); ++i) {
    if (!used[mas[start][i]]) {
      if (color[start] != color[mas[start][i]]) count++;
      dfs(mas[start][i], mas, used, count, color);
    }
  }
}
int main() {
  int n;
  cin >> n;
  vector<vector<int>> mas(n);
  for (int i = 0; i < n - 1; ++i) {
    int a;
    cin >> a;
    mas[i + 1].push_back(a - 1);
    mas[a - 1].push_back(i + 1);
  }
  vector<int> color(n);
  for (int i = 0; i < n; ++i) {
    cin >> color[i];
  }
  vector<bool> used(n, false);
  int count = 1;
  dfs(0, mas, used, count, color);
  cout << count;
  return 0;
}
