In event path calculation, it's expected that we'd have a lot of queries to check if given two tree scopes in the tree of trees are in ancestor/descendant relationships. In the current implementation (TreeScope::isOlderSiblingOrInclusiveAncestor), this query takes O(N), where N is the height of the tree of trees. That causes the entire calculation of event.path for each node, on which even.path wo