Deepest Root

def solve(____):
    from collections import defaultdict
    graph = defaultdict(____)
    for e in edges.split(____):
        u, v = map(int, e.split(____))
        graph[u].append(____)
        graph[v].append(____)
    def dfs(____):
        max_depth = ____
        for v in graph[u]:
            if v not in visited:
                visited.add(____)
                max_depth = max(max_depth, dfs(____) + ____)
        return max_depth
    depths = []
    for i in range(____, n + ____):
        visited = {i}
        depths.append(dfs(____))
    max_depth = max(____)
    for i, d in enumerate(____):
        if d == max_depth:
            print(____)