you unweighte tree n vertex you assign positive weight edge follow condition hold for different leave v_1 v_2 tree bitwise XOR weight edge simple path v_1 v_2 equal 0 note large positive integer like 101010its guarantee assignment exist give constraint now let define f number distinct weight assignment in example assignment valid bitwise XOR edge weight pair leave 0 f value 2 2 distinct edge weights4 5 in example assignment invalid bitwise XOR edge weight vertex 1 vertex 6 3 4 5 4 0 what minimum maximum possible value f give tree find print