B"In Fire City, there are n intersections and m one-way roads. The i -th road goes from intersection a_i to b_i and has length l_i miles. There are q cars that may only drive along those roads. The i -th car starts at intersection v_i and has an odometer that begins at s_i , increments for each mile driven, and resets to 0 whenever it reaches t_i . Phoenix has been tasked to drive cars along some roads (possibly none) and return them to their initial intersection with the odometer showing 0 . For each car, please find if this is possible. A car may visit the same road or intersection an arbitrary number of times. The odometers don't stop counting the distance after resetting, so odometers may also be reset an arbitrary number of times. The first line of the input contains two integers n and m ( 2 <= n <= 2 cdot 10^5 ; 1 <= m <= 2 cdot 10^5 ) -- the number of intersections and the number of roads, respectively. Each of the next m lines contain three integers a_i , b_i , and l_i ( 1 <= a_i, b_i <= n ; a_i neq b_i ; 1 <= l_i <= 10^9 ) -- the information about the i -th road. The graph is not necessarily connected. It is guaranteed that between any two intersections, there is at most one road for each direction. The next line contains an integer q ( 1 <= q <= 2 cdot 10^5 ) -- the number of cars. Each of the next q lines contains three integers v_i , s_i , and t_i ( 1 <= v_i <= n ; 0 <= s_i < t_i <= 10^9 ) -- the initial intersection of the i -th car, the initial number on the i -th odometer, and the number at which the i -th odometer resets, respectively. Print q answers. If the i -th car's odometer may be reset to 0 by driving through some roads (possibly none) and returning to its starting intersection v_i , print YES. Othe"...