Minimum Score After Removals on a Tree

Given a tree with integer node values, remove two edges to split it into three components and minimize the difference between the largest and smallest component XORs. The core challenge is computing subtree XORs and efficiently evaluating cut pairs (considering ancestor/descendant relationships and subtree intervals) to avoid quadratic brute force.