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

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define se second

const int maxn = 100;

int n, k, q;
int par[1 + maxn];
int state[1 + maxn];
int subtreexor[1 + maxn];

void solve() {
    cin >> n >> k >> q;
    for(int i = 2; i <= n; i++) {
        cin >> par[i];
    }
    for(int qi = 1; qi <= q; qi++) {
        for(int i = 1; i <= n; i++) {
            cin >> state[i];
        }
        for(int j = 1; j <= k; j++) {
            for(int i = 1; i <= n; i++) {
                subtreexor[i] = 0;
            }
            for(int i = n; i >= 1; i--) {
                int prevxor = subtreexor[i];
                subtreexor[i] ^= state[i];
                state[i] ^= prevxor;
                subtreexor[par[i]] ^= subtreexor[i];
            }
        }
        cout << state[1] << "\n";
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
}