Envío 6106

Código

def ancestor(arbol):

    print(arbol)

    c = int(input())

    for i in range(c):
        flag = False
        nodos = input().split(' ')
        ancestor = nodos[0]
        child  = nodos[1]
        if ancestor == child:
            print('Yes')
            continue 
        
        parent = arbol[child]  
        if parent == ancestor:
            print('Yes')
        else: 
            print('No')
        

def graph(N):

    arbol = {}
    for i in range(N-1):
        arbolData = input().split(' ') # 0 1 =  0 is parent and 1 is child
        arbol['0'] = None
        arbol[arbolData[1]] = arbolData[0] # key=child and value=parent
    ancestor(arbol)

n = int(input())
print(graph(n))