debug

#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5;
int n;
int a[maxn+1000];
int power[maxn+1000];
struct Node
{
    int now;
    int l,r;
}point[maxn+1000];
int head[maxn+1000],p=0;
struct Edge
{
    int u,next;
}edges[maxn+1000];
void add(int u,int v)
{
    edges[p].u=v;
    edges[p].next=head[u];
    head[u]=p++;
}
int num=1;
void dfs(int u) //dfs序
{
    point[u].now=num,point[u].l=num++;
    int sum=0;
    for(int i=head[u];i!=-1;i=edges[i].next)
    {
        int u=edges[i].u;
        sum=sum+power[u];
        dfs(u);
    }
    point[u].r=num-1;
}
int Num[maxn+1000];
struct xian_duan_shu
{
    int sum,mark;
}c[4*maxn+1000];
//2_debug 2^(log(2,n)+1)-1~=2*n-1 由于push_down要多加一层变4*n
//3*n,,没想到wr..到底还是试查到了这步
void build(int root,int l,int r)
{
    if(l==r){c[root].sum=Num[l],c[root].mark=0;return;}
    int mid=(l+r)/2;
    build(2*root,l,mid);
    build(2*root+1,mid+1,r);
    c[root].sum=c[2*root].sum+c[2*root+1].sum;
}
void push_down(int root,int l,int r)//线段树的关键
{    //处理好mark以上(回溯)及以下部分(push_down函数)确保mark标记不影响线段树的性质
  if(c[root].mark&1)
  {
      c[root].mark=0;
      c[root].sum=r-l+1-c[root].sum;
      c[2*root].mark=c[2*root].mark+1,c[2*root+1].mark=c[2*root+1].mark+1;
  }
  else c[root].mark=0;
}
void update(int root,int l,int r,int from,int to)
{
    push_down(root,l,r);
    if(l>to||r<from) return;
    if(l>=from&&r<=to)
    {
         c[root].mark=c[root].mark+1;push_down(root,l,r);
         return;
    }
    int mid=(l+r)/2;
    update(2*root,l,mid,from,to);         //1_debug 区间更新
    update(2*root+1,mid+1,r,from,to);    //区间更新
    c[root].sum=c[2*root].sum+c[2*root+1].sum;
}
int query(int root,int l,int r,int from,int to)
{
    push_down(root,l,r);
    if(l>to||r<from) return 0;
    if(l>=from&&r<=to) return c[root].sum;
    int mid=(l+r)/2;
    int tmp=query(2*root,l,mid,from,to)+query(2*root+1,mid+1,r,from,to);
    c[root].sum=c[2*root].sum+c[2*root+1].sum;
    return tmp;
}
void init()
{
    num=1;
    dfs(1);
    for(int i=1;i<=n;i++)
    {
        Num[point[i].now]=power[i];
    }
    build(1,1,n);
}
void input()
{
       memset(head,-1,sizeof(head));
       p=0;
       a[1]=1;
       for(int i=2;i<=n;i++)
       {
           scanf("%d",&a[i]);
           add(a[i],i);
       }
       for(int i=1;i<=n;i++) scanf("%d",&power[i]);
}
void solve()
{
       int m;
       scanf("%d",&m);
       while(m--)
       {
           char str[10];
           int u;
           scanf("%s%d",str,&u);
           if(str[0]=='g')
           {
               printf("%d\n",query(1,1,n,point[u].l,point[u].r));
           }
           else
           {
               update(1,1,n,point[u].l,point[u].r);
           }
       }
}
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
       input();
       init();
       solve();
    }
    return 0;
}