#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cctype>

#include <algorithm>
#include <random>
#include <bitset>
#include <queue>
#include <functional>
#include <set>
#include <map>
#include <vector>
#include <chrono>
#include <iostream>
#include <limits>
#include <numeric>

#define LOG(FMT...) fprintf(stderr, FMT)

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template <class T>
istream &operator>>(istream &is, vector<T> &v) {
    for (T &x : v) is >> x;
    return is;
}

template <class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    if (!v.empty()) {
        os << v.front();
        for (int i = 1; i < v.size(); ++i) os << ' ' << v[i];
    }
    return os;
}

const int N = 525105, L = 21;

namespace Trie {

struct Node {
    int par, xsum;
    int ch[2];
} P[N * (L + 1)];

int top;

void update(int o, int l) {
    P[o].xsum = P[P[o].ch[0]].xsum ^ P[P[o].ch[1]].xsum ^ (P[P[o].ch[1]].par << l);
    P[o].par = P[P[o].ch[0]].par ^ P[P[o].ch[1]].par;
}

void carry(int o, int l) {
    if (!o || l == L)
        return;
    swap(P[o].ch[0], P[o].ch[1]);
    carry(P[o].ch[0], l + 1);
    update(o, l);
}

int merge(int x, int y) {
    if (!x || !y)
        return x ^ y;
    P[x].par ^= P[y].par;
    P[x].xsum ^= P[y].xsum;
    for (int i = 0; i < 2; ++i) P[x].ch[i] = merge(P[x].ch[i], P[y].ch[i]);
    return x;
}

int single(int x, int l) {
    int o = ++top;
    P[o].par = 1;
    if (l == L)
        return o;
    P[o].ch[(x >> l) & 1] = single(x, l + 1);
    update(o, l);
    return o;
}

}  // namespace Trie

int n;
int v[N];
vector<int> g[N];

ll ans;

int dfs(int u) {
    int ret = 0;
    for (int gv : g[u]) ret = Trie::merge(ret, dfs(gv));
    Trie::carry(ret, 0);
    ret = Trie::merge(ret, Trie::single(v[u], 0));
    ans += Trie::P[ret].xsum;
    return ret;
}

int main() {
#ifdef ELEGIA
    freopen("test.in", "r", stdin);
    int nol_cl = clock();
#endif
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> v[i];
    for (int i = 2; i <= n; ++i) {
        int p;
        cin >> p;
        g[p].push_back(i);
    }
    dfs(1);
    cout << ans << '\n';

#ifdef ELEGIA
    LOG("Time: %dms\n", int((clock() - nol_cl) / (double)CLOCKS_PER_SEC * 1000));
#endif
    return 0;
}