Function to traverse the graph and find the minimum of maximum size forest after removing a Node
def dfs ( Node , parent ) : NEW_LINE INDENT size [ Node ] = 1 ; NEW_LINE mx = 0 ; NEW_LINE global mini NEW_LINE global ans NEW_LINE DEDENT