Leetcode 1339. Maximum Product of Splitted Binary Tree

Find an edge whose removal splits the tree into two subtrees such that the product of their sums is maximized, and return that maximum product modulo 10^9+7. (Consider subtree sums for every possible split; n ≤ 5×10^4, node values ≤ 10^4.)