1
#include <bits/stdc++.h>
2
using namespace std;
3

4
const int N = 1e5 + 100;
5

6
int n, p[N], q[N], f[N], ans[N];
7
vector<int> e[N];
8

9
struct BIT {
10
    int f[N];
11
    int lowbit(int i) { return i & (-i); }
12
    void Modify(int pos, int v) {
13
        for (int i = pos; i <= n; i += lowbit(i)) {
14
            f[i] += v;
15
        }
16
    }
17
    int Query(int pos) {
18
        if (pos == 0)
19
            return 0;
20
        int ans = 0;
21
        for (int i = pos; i >= 1; i -= lowbit(i)) {
22
            ans += f[i];
23
        }
24
        return ans;
25
    }
26
    int Query(int l, int r) { return Query(r) - Query(l - 1); }
27
} bit;
28

29
void dfs(int u) {
30
    int tot = bit.Query(p[u] + 1, n);
31
    bit.Modify(p[u], 1);
32
    for (auto v : e[u]) {
33
        dfs(v);
34
    }
35
    ans[u] = bit.Query(p[u] + 1, n) - tot;
36
}
37

38
signed main() {
39
    cin >> n;
40
    for (int i = 1; i <= n; i++) {
41
        cin >> p[i];
42
        q[i] = p[i];
43
    }
44
    sort(q + 1, q + n + 1);
45
    for (int i = 1; i <= n; i++) {
46
        p[i] = lower_bound(q + 1, q + n + 1, p[i]) - q;
47
    }
48
    for (int i = 2; i <= n; i++) {
49
        cin >> f[i];
50
        e[f[i]].push_back(i);
51
    }
52
    dfs(1);
53
    for (int i = 1; i <= n; i++) {
54
        cout << ans[i] << endl;
55
    }
56
    return 0;
57
}