#645 · #3108 · Minimum Cost Walk in Weighted Graph(带权图里旅游的最小代价)

You are given n nodes, edges[i] = [u, v, w] as undirected weighted edges, and query[i] = [s, t]. The cost of a walk from s to t is the bitwise AND of all edge weights on it. Return the minimum cost for each query, or -1 if unreachable. Constraints: 2 <= n <= 10^5, 1 <= edges.length <= 10^5, 1 <= query.length <= 10^5.