she utmost flawlessly carry person rite preserve world balance yin yangHu Tao little prankster try scare graph problem you give connect undirected graph n node m edge you q query each query consist node bInitially edge graph weight 0 for query choose simple path start end b then add 1 edge path determine possible processing q query edge graph weight if output choice path query if possible determine small number extra query add possible it show number exceed 1018 give constraintsA simple path define path visit node onceAn edge say weight value divisible 2