#include <bits/stdc++.h>
#define pb push_back 
#define ott(i,l,r) for (int i = l; i <= r; i ++)
#define tto(i,l,r) for (int i = r; i >= l; i --)
using namespace std;
using ll = long long;
int read () {
	int x = 0; bool f = 0; char c = getchar ();
	while (!isdigit (c)) f |= (c == '-'), c = getchar ();
	while (isdigit (c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar ();
	if (f) x = -x; return x;
}
const int N = 3e5 + 110;
int n, m, q, idx, B;
ll res;
vector <int> e[N], E[N];
int up[N], dn[N];
int dfn[N], dep[N], fa[N];
int lg[N << 1], f[N << 1][20];
char s[N];
void dfs0 (int u) {
	f[dfn[u] = ++ idx][0] = u, dep[u] = dep[fa[u]] + 1;
	for (int v : e[u]) {
		dfs0 (v);
		f[++ idx][0] = u;
	}
	return ;
}
int lca (int x, int y) {
	x = dfn[x], y = dfn[y];
	if (x > y) swap (x, y);
	int z = lg[y - x + 1], f1 = f[x][z], f2 = f[y - (1 << z) + 1][z];
	return dep[f1] < dep[f2] ? f1 : f2;
}
struct OPT {
	int x; char c;
} a[N];
struct BLOCK {
	int ac, now, sum;//ac = 'A'count
	int s[1201];
	void ins (int v) {
		if (v >= now) ++ sum;
		if (-m <= v && v <= m) ++ s[v + m];
		return ;
	}
	void add (int v) {
		if (v == 1) {
			sum -= s[(now ++) + m];
			res -= 1ll * sum;
		}
		if (v == -1) {
			res += 1ll * sum;
			sum += s[(-- now) + m];
		}
		return ;
	}
	void clear () {
		ac = now = sum = 0;
		ott (i, 0, m + m) s[i] = 0;
		return ;
	}
} b[N];
int t[N], FA[N], bl[N], oth[N];
bool cmp (int x, int y) {
	return dfn[x] < dfn[y];
}
void fuck (int u, int z) {
	bl[u] = z;
	for (int v : e[u]) fuck (v, z);
	return ;
}
void cpr (int u) {
	int OTH = 0;
	for (int v : e[u]) {
		if (bl[v]) cpr (v);
		else if (bl[u] < 0) {
			if (!OTH) OTH = t[++ t[0]] = v;
			fuck (v, OTH);
		}
		else {
			if (!oth[bl[u]]) oth[bl[u]] = t[++ t[0]] = v;
			fuck (v, oth[bl[u]]);
		}
		
	}
	return ;
}
int find (int u) {
	return bl[u] = (bl[fa[u]] ? u : find (fa[u]));
}
void red (int u) {
	dn[u] = 0;
	for (int v : e[u]) {
		up[v] = up[u] + (s[u] != 'C');
		red (v);
		dn[u] += dn[v] + (s[v] != 'A');
	}
	if (s[u] == 'A') res += 1ll * dn[u];
	if (s[u] == '?') res += 1ll * max (0, dn[u] - up[u]);
	return ;
}
void cup (int u, int val) {
	for (int v : E[u]) {
		if (bl[v] < 0) {
			if (s[v] == '?') res -= 1ll * max (0, dn[v] - up[v]);
			up[v] += val;
			if (s[v] == '?') res += 1ll * max (0, dn[v] - up[v]);
		}
		else {
			b[v].add (val);
		}
		cup (v, val);
	}
	return ;
}
void cdn (int u, int val) {
	if (!u) return ;
	if (bl[u] < 0) {
		if (s[u] == '?') res -= 1ll * max (0, dn[u] - up[u]);
		dn[u] += val; if (s[u] == 'A') res += 1ll * val;
		if (s[u] == '?') res += 1ll * max (0, dn[u] - up[u]);
	}
	else {
		b[u].add (-val), res += 1ll * b[u].ac * val;
	}
	cdn (FA[u], val);
	return ;
}

void sol () {
    ott (i, 1, m) t[++ t[0]] = a[i].x;//ott (i, 1, n) t[++ t[0]] = i;
    sort (t + 1, t + 1 + t[0]), t[0] = unique (t + 1, t + 1 + t[0]) - t - 1;
    sort (t + 1, t + 1 + t[0], cmp);
    ott (i, 2, t[0]) t[t[0] + i - 1] = lca (t[i - 1], t[i]); t[t[0] += t[0]] = 1;
    sort (t + 1, t + 1 + t[0]), t[0] = unique (t + 1, t + 1 + t[0]) - t - 1;
    ott (i, 1, t[0]) bl[t[i]] = -t[i];//区分会修改的点
    ott (i, 2, t[0]) {
    	int now = fa[t[i]];
    	if (!bl[now]) t[++ t[0]] = find (now);
	}
	cpr (1), sort (t + 1, t + 1 + t[0], cmp);
	ott (i, 1, n) {
		if (bl[i] < 0) continue;
		if (s[i] == 'A') ++ b[bl[i]].ac;
		if (s[i] == '?') b[bl[i]].ins (dn[i] - up[i]);
	}
	ott (i, 2, t[0]) E[FA[t[i]] = abs (bl[lca (t[i - 1], t[i])])].pb (t[i]);
	ott (i, 1, m) {
		int x = a[i].x; char c = a[i].c;
		if (s[x] != 'C') cup (x, -1); if (s[x] != 'A') cdn (FA[x], -1);
		if (s[x] == 'A') res -= 1ll * dn[x];
		if (s[x] == '?') res -= 1ll * max (0, dn[x] - up[x]);
		s[x] = c;
		if (s[x] == 'A') res += 1ll * dn[x];
		if (s[x] == '?') res += 1ll * max (0, dn[x] - up[x]);
		if (s[x] != 'C') cup (x, 1); if (s[x] != 'A') cdn (FA[x], 1);
		printf ("%lld\n", res);
	}
	ott (i, 1, t[0]) {
		FA[t[i]] = 0, E[t[i]].clear ();
		if (bl[t[i]] == t[i]) b[t[i]].clear (), oth[t[i]] = 0;
		t[i] = 0;
	}
	ott (i, 1, n) bl[i] = 0;
	t[0] = m = 0, res = 0; red (1);
	return ;
}
int main () {
	//freopen ("data.in", "r", stdin);
	//freopen ("res.out", "w", stdout);
	n = read (), q = read (), scanf ("%s", s + 1); ott (i, 2, n) e[fa[i] = read ()].pb (i);
	lg[0] = -1;
	B = (int)sqrt (q); dfs0 (1);
	ott (j, 1, 19) {
		ott (i, 1, idx - (1 << j) + 1) {
			int f1 = f[i][j - 1], f2 = f[i + (1 << j - 1)][j - 1];
			f[i][j] = dep[f1] < dep[f2] ? f1 : f2;
		}
	}
	ott (i, 1, idx) lg[i] = lg[i >> 1] + 1;
	red (1); ott (i, 1, q) {
		int x = read (); char c = getchar ();
		a[++ m] = {x, c};
		if (i % B == 0 || i == q) sol ();
	}
	return 0;
}