Leetcode 2846. Minimum Edge Weight Equilibrium Queries in a Tree

Given a weighted tree and many independent queries, for each query compute the minimum number of edge weight changes needed to make all edges on the a–b path equal — equivalently, path length minus the frequency of the most common weight on that path. The core challenge is answering "most-frequent-weight-on-path" queries efficiently over the tree.