Tony Stark is playing a game with his suits (they have auto-pilot now). He lives in Malibu. Malibu has n junctions numbered from 1 to n, connected with n - 1 roads. One can get from a junction to any other junction using these roads (graph of Malibu forms a tree).

Tony has m suits. There's a special plan for each suit. The i-th suit will appear at the moment of time t_i in the junction v_i, and will move to junction u_i using the shortest path between v_i and u_i with the speed c_i roads per second (passing a junctions takes no time), and vanishing immediately when arriving at u_i (if it reaches u_i in time q, it's available there at moment q, but not in further moments). Also, suits move continuously (for example if v_i ≠ u_i, at time it's in the middle of a road. Please note that if v_i = u_i it means the suit will be at junction number v_i only at moment t_i and then it vanishes.

An explosion happens if at any moment of time two suits share the same exact location (it may be in a junction or somewhere on a road; while appearing, vanishing or moving).

Your task is to tell Tony the moment of the the first explosion (if there will be any).

The first line of the input contains two integers n and m (1 ≤ n, m ≤ 100 000) — the number of junctions and the number of suits respectively.

The next n - 1 lines contain the roads descriptions. Each line contains two integers a_i and b_i — endpoints of the i-th road (1 ≤ a_i, b_i ≤ n, a_i ≠ b_i).

The next m lines contain the suit descriptions. The i-th of them contains four integers t_i, c_i, v_i and u_i (0 ≤ t_i ≤ 10 000, 1 ≤ c_i ≤ 10 000, 1 ≤ v_i, u_i ≤ n), meaning the i-th suit will appear at moment of time t_i at the junction v_i and will move to the junction u_i with a speed c_i roads per second.

If there would be no explosions at all, print -1 in the first and only line of output.

Otherwise print the moment of the first explosion.

Your answer will be considered correct if its relative or absolute error doesn't exceed 10^- 6.