Tree Distances II used rerooting on an undirected tree. Now let's apply rerooting to directed edges.
Given a tree with directed edges, find which nodes can be the capital with minimum edge reversals. For each node, count how many edges need to be reversed to reach all other nodes.
Think: When moving the root from u to v, how does the reversal count change based on the edge direction between them?