Let $T$ is a tree graph with the $N$ vertices and edges of $T$ have integer weights, $M$ is an integer value.
Task is check existing of vertices $a$, $b$ in $T$ with weight of way from $a$ to $b$ in $T$ is $M$.
Question: can this task be solved in $o(N \cdot \log N)$?
Known algorithm has $O(N \cdot \log N)$ time complexity.