  Given a tree of weighted vertices, it is sometimes possible to break the tree
into two equally-weighted subtrees within an allowable error. We give a fast
algorithm that finds an edge which breaks the tree into equal-weight components
or determines there is no such edge.
