def dfs(node, visited=set()):
    if node in visited: return 0
    visited.add(node)
    return 1 + sum(dfs(n, visited) for n in adj[node])
adj = {1:[2,3], 2:[1], 3:[1]}
print(dfs(1))