Maximum Edge on a Tree Path

A weighted tree is rooted at node 1. For each query (u, v) print the largest edge weight on the path between them (print 0 when u = v). Extend binary lifting with a max-weight table.

1 <= n, q <= 10^5 1 <= w <= 10^9