Обход данных

CLASSES = dict()
 
for i in range(int(input())):
    x = input()
    if ':' in x:
        b,a = x.split(':')
        a = a.replace(' ', '')
        # Если ключа А не существует то создаем новый
        if a not in CLASSES.keys():
          b = b.split()
          for item in a:
            CLASSES[item]=b
        else:
          if len(b)>1:
            b = b.split()
            for item in b:
              CLASSES[a].append(item)
          else:
            CLASSES[a].append(b)
    else:
      # A
        CLASSES[x] = [x]
def is_parent(first_class, second_class):
    if first_class not in CLASSES.keys():
      return 'No'
    elif first_class in CLASSES.keys() and second_class in CLASSES[first_class]:
        return 'Yes'
    
    for k,v in CLASSES.items():
        if second_class in v:
          if is_parent(first_class, k):
            return 'Yes'
    return 'No'
 
for t in range(int(input())):
    x = input().split()
    print(is_parent(x[0], x[1]))

g = {}
for _ in range(int(input())):
    s = input()
    if ':' in s:
        child, parents = s.split(':')
        parents = parents.split()
    else:
        child = parents = s
    for parent in parents:
        if parent not in g:
            g[parent] = [child]
        else:
            g[parent].append(child)
print(g)

dictionary = {}
 
for _ in range(int(input())):
    line = input()
    if ":" not in line:
        dictionary[line] = set()
    else:
        name, other = line.split(" : ")
        bases = set()
        for base in other.split():
            bases.add(base)
            if base in dictionary:
                bases.update(dictionary[base])
        dictionary[name] = bases
 
 
for _ in range(int(input())):
    parent, child = input().split()
    print("Yes" if parent in dictionary[child] else "No")

def dfs(classes, start, end, path=[]):
    if not path:
        path = [start]
    if start == end:
        yield path
    for node in classes[start]:
        yield from dfs(classes, node, end, path + [node])
 
 
classes = {}
for _ in range(int(input())):
    s = input()
    if ':' in s:
        child, parents = s.split(' : ')
        parents = parents.split()
        if child not in classes:
            classes[child] = []
        for parent in parents:
            classes[child].append(parent)
            if parent not in classes:
                classes[parent] = []
    else:
        child = s
        if child not in classes:
            classes[child] = []
 
# print(*classes.items(), sep='\n')
 
for _ in range(int(input())):
    parent, child = input().split()
    if (parent in classes and child in classes) \
            and list(dfs(classes, child, parent)):
        # print(*dfs(classes, child, parent))
        print('Yes')
    else:
        print('No')