Problem: It's May in Flatland, and there are m days in this month. Despite the fact that May Holidays are canceled long time ago, employees of some software company still have a habit of taking short or long vacations in May.

Of course, not all managers of the company like this. There are n employees in the company that form a tree-like structure of subordination: each employee has a unique integer id i between 1 and n, and each employee with id i (except the head manager whose id is 1) has exactly one direct manager with id p_i. The structure of subordination is not cyclic, i.e. if we start moving from any employee to his direct manager, then we will eventually reach the head manager. We define that an employee u is a subordinate of an employee v, if v is a direct manager of u, or the direct manager of u is a subordinate of v. Let s_i be the number of subordinates the i-th employee has (for example, s_1 = n - 1, because all employees except himself are subordinates of the head manager).

Each employee i has a bearing limit of t_i, which is an integer between 0 and s_i. It denotes the maximum number of the subordinates of the i-th employee being on vacation at the same moment that he can bear. If at some moment strictly more than t_i subordinates of the i-th employee are on vacation, and the i-th employee himself is not on a vacation, he becomes displeased.

In each of the m days of May exactly one event of the following two types happens: either one employee leaves on a vacation at the beginning of the day, or one employee returns from a vacation in the beginning of the day. You know the sequence of events in the following m days. Your task is to compute for each of the m days the number of displeased employees on that day.

Input

The first line contains two integers n and m (2 ≤ n, m ≤ 10^5) — the number of employees in the company and the number of days in May.

The second line contains n - 1 integers p_2, p_3, …, p_n (1 ≤ p_i ≤ n), denoting the direct managers of employees.

The third line contains n integers t_1, t_2, …, t_n (0 ≤ t_i ≤ s_i), denoting the bearing limits of empoyees.

The fourth line contains m integers q_1, q_2, …, q_m (1 ≤ |q_i| ≤ n, q_i ≠ 0), denoting the events. If q_i is positive, then the employee with id q_i leaves for a vacation starting from this day, if q_i is negative, then the employee -q_i returns from a vacation starting from this day. In the beginning of May no employee is on vacation. It is guaranteed that if some employee leaves for a vacation, he is not on a vacation at the moment and vice versa.

Output

Print a sequence of m integers a_1, a_2, …, a_m, where a_i is the number of displeased employees on the i-th day.

Examples

Input

7 8
4 5 1 1 5 5
0 0 0 1 2 0 0
2 6 3 7 -2 4 -3 1


Output

1 1 1 2 2 2 1 0


Input

5 6
1 2 3 4
4 0 0 1 0
1 5 2 3 -5 -1


Output

0 2 1 0 0 0

Note

In the first sample test after employee with id 2 leaves for a vacation at the first day, the head manager with id 1 becomes displeased as he does not want any of his subordinates to go for a vacation. At the fourth day employee with id 5 becomes displeased as his last remaining employee with id 7 leaves for a vacation. At the fifth day employee with id 2 returns from the vacation, but it does not affect the number of displeased employees as the employees 5 and 1 are still displeased. At the sixth day employee with id 3 returns back from the vacation, preventing the employee with id 5 from being displeased and at the last day the head manager with id 1 leaves for a vacation, leaving the company without the displeased people at all.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int s = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')
    s = (s << 3) + (s << 1) + ch - '0', ch = getchar();
  return s * f;
}
const int N = 1e5 + 5, M = 320;
int n, m, fa[N], top[N], t[N], sz[N], son[N];
struct Edge {
  int to, next;
} e[N];
int head[N], ecnt, id[N], pos[N], L[M], R[M];
inline void adde(int u, int v) {
  e[++ecnt].next = head[u];
  e[ecnt].to = v;
  head[u] = ecnt;
}
void dfs1(int u) {
  sz[u] = 1;
  for (int i = head[u], v; i; i = e[i].next) {
    v = e[i].to;
    dfs1(v);
    sz[u] += sz[v];
    if (sz[son[u]] < sz[v]) son[u] = v;
  }
}
int inde, p[N], cnt[M][N], ans, tag[M], blk, blksz;
void dfs2(int u, int fr) {
  id[u] = ++inde;
  p[inde] = u;
  top[u] = fr;
  ++cnt[pos[inde]][t[u]];
  if (son[u]) dfs2(son[u], fr);
  for (int i = head[u], v; i; i = e[i].next) {
    v = e[i].to;
    if (v != son[u]) dfs2(v, v);
  }
}
bool black[N];
inline void modify_blk(int x, int l, int r, int val) {
  if (l <= L[x] && R[x] <= r) {
    if (val > 0) {
      ++tag[x];
      ans += cnt[x][tag[x]];
    } else {
      ans -= cnt[x][tag[x]];
      --tag[x];
    }
  } else {
    for (int i = max(l, L[x]), u; i <= min(r, R[x]); ++i) {
      u = p[i];
      if (black[u]) {
        if (val > 0)
          --t[u];
        else
          ++t[u];
        continue;
      }
      if (val > 0) {
        --cnt[x][t[u]];
        ++cnt[x][--t[u]];
        if (t[u] == tag[x]) ++ans;
      } else {
        --cnt[x][t[u]];
        if (t[u] == tag[x]) --ans;
        ++cnt[x][++t[u]];
      }
    }
  }
}
inline void modify_node(int u, int val) {
  if (black[u] && !val) {
    ++cnt[pos[id[u]]][t[u]];
    if (t[u] <= tag[pos[id[u]]]) ++ans;
  } else if (!black[u] && val) {
    --cnt[pos[id[u]]][t[u]];
    if (t[u] <= tag[pos[id[u]]]) --ans;
  }
  black[u] = val;
}
inline void modify(int x, int val) {
  if (black[x] == val) return;
  modify_node(x, val);
  int u = fa[x], l, r;
  while (u) {
    l = id[top[u]];
    r = id[u];
    if (pos[l] == pos[r]) {
      modify_blk(pos[l], l, r, black[x]);
    } else {
      modify_blk(pos[l], l, r, black[x]);
      modify_blk(pos[r], l, r, black[x]);
      for (int i = pos[l] + 1; i < pos[r]; ++i) modify_blk(i, l, r, black[x]);
    }
    u = fa[top[u]];
  }
}
int main() {
  n = read();
  m = read();
  for (int i = 2; i <= n; ++i) fa[i] = read(), adde(fa[i], i);
  for (int i = 1; i <= n; ++i) t[i] = read() + 1;
  blksz = min(N / (M - 2), int(sqrt(n)));
  blk = (n - 1) / blksz + 1;
  for (int i = 1; i <= n; ++i) pos[i] = (i - 1) / blksz + 1;
  for (int i = 1; i <= blk; ++i) L[i] = (i - 1) * blksz + 1, R[i] = i * blksz;
  R[blk] = n;
  dfs1(1);
  dfs2(1, 0);
  while (m--) {
    int node = read(), val = 1;
    if (node < 0) node = -node, val = 0;
    modify(node, val);
    printf("%d ", ans);
  }
  return 0;
}