#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
template <typename first, typename second>
ostream& operator<<(ostream& os, const pair<first, second>& p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  os << "{";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ",";
    os << *it;
  }
  return os << "]";
}
template <typename T>
ostream& operator<<(ostream& os, const multiset<T>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "]";
}
template <typename first, typename second>
ostream& operator<<(ostream& os, const map<first, second>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << it->first << " = " << it->second;
  }
  return os << "]";
}
void faltu() { cerr << '\n'; }
template <typename T>
void faltu(T a[], int n) {
  for (int i = 0; i < n; ++i) cerr << a[i] << ' ';
  cerr << '\n';
}
template <typename T, typename... hello>
void faltu(T arg, const hello&... rest) {
  cerr << arg << ' ';
  faltu(rest...);
}
const int mx = 1e6 + 5;
int n;
vector<pair<int, int> > adjlist[mx];
int a[mx];
bool leaf[mx];
int dp[mx];
int dfs(int u, int sum) {
  int cnt = 0;
  if (leaf[u]) {
    dp[u] = min(dp[u], sum + 1);
    ++cnt;
  }
  for (auto v : adjlist[u]) {
    dp[v.second] = dp[u] + 1;
    cnt += dfs(v.second, min(sum + cnt, dp[u] + cnt));
  }
  return cnt;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    int u;
    char x;
    cin >> u >> x;
    adjlist[u].push_back(make_pair(x, i));
  }
  for (int i = 0; i <= n; ++i) sort(adjlist[i].begin(), adjlist[i].end());
  int k;
  cin >> k;
  for (int i = 0; i < k; ++i) {
    cin >> a[i];
    leaf[a[i]] = 1;
  }
  int gar = dfs(0, 0);
  for (int i = 0; i < k; ++i) cout << dp[a[i]] << " ";
  cout << '\n';
}
