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

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

const int maxn = 1e5 + 7;

int n, q;
int par[1 + maxn];
vector<int> graph[1 + maxn];
int val[1 + maxn];
int dist[1 + maxn];
int in[1 + maxn];
int ending[1 + maxn];
int timer;

int tree[1 + 4 * maxn];
int lazy[1 + 4 * maxn];

void build(int v, int vl, int vr) {
    if(vl == vr) {
        tree[v] = dist[vl];
    } else {
        int mid = (vl + vr) / 2;
        build(2 * v, vl, mid);
        build(2 * v + 1, mid + 1, vr);
        tree[v] = tree[2 * v] + tree[2 * v + 1];
    }
}

void prop(int v, int vl, int vr) {
    if(lazy[v] != 0) {
        if(vl != vr) {
            lazy[2 * v] ^= 1;
            lazy[2 * v + 1] ^= 1;
        }
        tree[v] = (vr - vl + 1) - tree[v];
        lazy[v] = 0;
    }
}

void update(int v, int vl, int vr, int ul, int ur) {
    //cout << v << " " << vl << " " << vr << "\n";
    prop(v, vl, vr);
    if(ul > vr || ur < vl) {
        return;
    }
    if(vl == ul && vr == ur) {
        lazy[v] ^= 1;
        prop(v, vl, vr);
        return;
    }
    prop(v, vl, vr);
    int mid = (vl + vr) / 2;
    update(2 * v, vl, mid, ul, min(ur, mid));
    update(2 * v + 1, mid + 1, vr, max(ul, mid + 1), ur);
    tree[v] = tree[2 * v] + tree[2 * v + 1];
}

void dfs_euler(int cur) {
    timer++;
    in[cur] = timer;
    for(int nei : graph[cur]) {
        dfs_euler(nei);
    }
    ending[cur] = timer;
}

void solve() {
    cin >> n >> q;
    for(int i = 2; i <= n; i++) {
        cin >> par[i];
        graph[par[i]].pb(i);
    }
    dfs_euler(1);
    for(int i = 2; i <= n; i++) {
        cin >> val[i];
        dist[in[i]] = dist[in[par[i]]] ^ val[i];
    }
    build(1, 1, n);
    /*for(int i = 1; i <= n; i++) {
        cout << dist[i] << " " << ending[i] << "\n";
    }*/
    for(int qi = 0; qi <= q; qi++) {
        if(qi != 0) {
            int change;
            cin >> change;
            change++;
            // upd
            update(1, 1, n, in[change], ending[change]);
            //cout << in[change] << " " << ending[change] << "\n";
        }
        int ans = 0;
        int even_cnt = tree[1];
        //cout << "-----\n";
        int odd_cnt = n - even_cnt;
        ans += even_cnt * (even_cnt - 1) / 2;
        ans += odd_cnt * (odd_cnt - 1) / 2;
        cout << ans << " ";
    }
    cout << "\n";
}

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