#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define FastIO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
using namespace std;
typedef long long ll;
set<ll> dfs(ll vertex, ll parent, vector<bool> &states, const vector<vector<ll>> &tree) {
    bool si;
    set<ll> signals;
    for(const auto &x : tree[vertex]) {
        if(x == parent)
            continue;
        set<ll> ns = dfs(x, vertex, states, tree);
        signals.insert(all(ns));
    }
    si = (states[vertex] + distance(signals.begin(), signals.lower_bound(vertex))) % 2;
    states[vertex] = (states[vertex] + signals.size()) % 2;
    if(si)
        signals.insert(vertex);
    return signals;
}
int main() {
    FastIO;
    ll i, u, s, N, K, Q;
    cin >> N >> K >> Q;
    vector<vector<ll>> tree(N);
    for(i = 1; i < N; i++) {
        cin >> u;
        u--;
        tree[i].push_back(u);
        tree[u].push_back(i);
    }
    vector<bool> states(N);
    while(Q--) {
        for(i = 0; i < N; i++) {
            cin >> s;
            states[i] = s;
        }
        for(i = 0; i < K; i++)
            dfs(0, -1, states, tree);
        cout << states[0] << '\n';
    }
    return 0;
}