#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<algorithm>
#include<cstring>
using namespace std;
struct Node{int val;int level;Node* left;Node* right;Node(){left = right = NULL;level = 0;}
};
map<int,int> valtoid;               //通过值去找id
map<int,Node*> valtonode;           //通过值去找节点
//构造数
Node* Insert(Node* node,int val)
{if(node==NULL){node = new Node();node->val= val;valtonode[val] = node;}else if(valtoid[val] < valtoid[node->val]){node->left = Insert(node->left,val);node->left->level = node->level+1;}else{node->right= Insert(node->right,val);node->right->level = node->level+1;}return node;
}
Node* root = NULL;
int n;
//是不是满二叉树
bool isFullTree(Node* root)
{queue<Node*> q;q.push(root);Node* node;while(!q.empty()){node = q.front();q.pop();if(node->left)q.push(node->left);if(node->right)q.push(node->right);if(node->left&&!node->right || !node->left&&node->right)return false;}return true;
}
//字符串中istart位置开始取某个单词（以空格结束）
int getNum(string str,int istart)
{int len = str.length();string strA="";for(int i=istart;i<len;++i)if(str[i]==' ') break;else strA += str[i];//printf("%s\n",strA.c_str());int a = atoi(strA.c_str());return a;
}
//是不是兄弟节点
bool isSiblings(Node* node,Node* child1,Node* child2)
{if(node==NULL) return false;if(node->left==child1&&node->right!=child2||node->left==child2&&node->right!=child1) return false;else if(node->left==child1&&node->right==child2||node->left==child2&&node->right==child1) return true;return isSiblings(node->left,child1,child2)||isSiblings(node->right,child1,child2);
}
//判断这一个这句话是不是对的
bool isRight(string str)
{if(str.find("root")!=-1){int a = getNum(str,0);return a == root->val;}else if(str.find("siblings")!=-1){int a = getNum(str,0);int b = getNum(str,str.find("of")+3);//兄弟节点，必须在同一层if(valtonode[b]&&valtonode[a]&&valtonode[b]->level==valtonode[a]->level){if(isSiblings(root,valtonode[a],valtonode[b]))return true;}return false;}else if(str.find("parent")!=-1){int a = getNum(str,0);int b = getNum(str,str.find("of")+3);if(valtonode[b]&&valtonode[a]){if(valtonode[a]->left == valtonode[b] || valtonode[a]->right == valtonode[b])return true;}return false;}else if(str.find("left")!=-1){int a = getNum(str,0);int b = getNum(str,str.find("of")+3);if(valtonode[b]&&valtonode[a]){if(valtonode[b]->left==valtonode[a])return true;}return false;}else if(str.find("right")!=-1){int a = getNum(str,0);int b = getNum(str,str.find("of")+3);if(valtonode[b]&&valtonode[a]){if(valtonode[b]->right==valtonode[a])return true;}}else if(str.find("same")!=-1){int a = getNum(str,0);int b = getNum(str,str.find("and")+4);if(valtonode[b]&&valtonode[a]){if(valtonode[b]->level==valtonode[a]->level)return true;}return false;}else if(str.find("full")!=-1){return isFullTree(root);}return false;
}
string mygets()
{char str[100];fgets(str,sizeof(str),stdin);int len = strlen(str);if(str[len-1]=='\n') str[len-1] = '\0';return str;
}
int main()
{#ifndef ONLINE_JUDGEfreopen("1.txt","r",stdin);#endifscanf("%d",&n);int post[n];for(int i=0;i<n;++i)scanf("%d",&post[i]);for(int i=0;i<n;++i){int a;scanf("%d",&a);valtoid[a] = i;}for(int i=n-1;i>=0;--i)root = Insert(root,post[i]);int m;scanf("%d",&m);getchar();for(int i=0;i<m;++i){string str = mygets();bool bRight = isRight(str);printf("%s\n",bRight?"Yes":"No");}return 0;
}