hdu 5735(dp)

#include <bits/stdc++.h>

#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;

#define LL long long
#define pii pair<int,int>
#define MP make_pair
#define ls i << 1
#define rs ls | 1
#define md (ll + rr >> 1)
#define lson ll, md, ls
#define rson md + 1, rr, rs
#define Pi acos(-1.0)
#define mod 1000000007
#define eps 1e-12
#define inf 0x3f3f3f3f
#define N 70010
#define M 1200020

const int m = 255;
char s[15];
int n, w[N], fa[N];
int fst[N], vv[M], nxt[M], e;
LL dp[N], ds[256][256], stk[N][256], tot;
void init(){
    memset(fst, -1, sizeof fst); e = 0;
}
void add(int u, int v){
    vv[e] = v, nxt[e] = fst[u], fst[u] = e++;
}
int calc(int u, int v){
    if(s[0] == 'A') return u & v;
    if(s[0] == 'X') return u ^ v;
    return u | v;
}
void dfs(int u, int p){
    dp[u] = 0;
    for(int i = 0; i <= m; ++i){
        dp[u] = max(dp[u], ds[i][w[u]&m] + calc((w[u] | m) ^ m, i << 8));
    }
    int a = w[u] >> 8, b = w[u] & m;
    memcpy(stk[tot], ds[a], sizeof stk[tot]);
    for(int i = 0; i <= m; ++i){
        ds[a][i] = max(ds[a][i], dp[u] + calc(i, b));
    }
    tot++;
    for(int i = fst[u]; ~i; i = nxt[i]){
        dfs(vv[i], u);
    }
    tot--;
    memcpy(ds[a], stk[tot], sizeof stk[tot]);
}
int main(){
    int cas;
    scanf("%d", &cas);
    while(cas--){
        scanf("%d%s", &n, s);
        init();
        for(int i = 1; i <= n; ++i) 
            scanf("%d", &w[i]);
        for(int i = 2; i <= n; ++i){
            scanf("%d", &fa[i]);
            add(fa[i], i);
        }
        memset(ds, -inf, sizeof ds);
        tot = 0;
        dfs(1, -1);
        int ans = 0;
        for(int i = 1; i <= n; ++i){
            ans = (ans + 1LL * i * (dp[i] + w[i]) % mod) % mod;
        }
        printf("%d\n", ans);
    }
    return 0;
}