Let G = (V, E) be a tree graph with root s with finite capacities assigned to each edge. Suppose we add an additional vertex t and edges with infinite capacity from all leaves in G to t. Find an O(|V |) algorithm to determine the maximum flow from s to t.