3108. Minimum Cost Walk in Weighted Graph

Given a weighted undirected graph. A walk's cost (edges and vertices may repeat) = the bitwise AND of the weights of all traversed edges. For queries (s, t), find the minimum-cost walk; −1 if no…