So the next thing we're going to compute is for each of the nodes, we're going to consider the set of nodes that are descendants of the node or reachable from the descendants of the node by one hop of a non-tree edge and of all those nodes that are reachable, we're going to look at the post-order value that is the smallest, we'll call that L. 