Prakhar lives in a town with $N$ cities and $N-1$ bidirectional roads such that there is a path between every pair of cities. You are given a weather forecast for $M$ days, which specifies a start city, an end city, and the amount of rainfall $X$ that all cities on the simple path between the start and end city (including the start and end cities themselves) will receive. Your task is to help him find the city that will receive the minimum amount of rainfall after $M$ days based on the given forecast. If there are multiple cities with the same minimum rainfall, print the city with the lowest city number.

Input format

1st line contains two integers $N$ and $M$ the number of cities and the number of days respectively.

Next $N-1$ lines contains two integers $A_i$ and $B_i$ denoting a road between the respecitve cities.

Next $M$ lines contains 3 integers $A_i$, $B_i$, $X$ the start city, the end city and the amount of rainfall they recieved respectively.

Output format

Print the city with the minimum rainfall recieved after $M$ days. If there are multiple answers, print the one with the least city index.

Constraints

$1<= N,M <= 2*10^5$

$1<= A_i, B_i <=N$

$0<=X<=10^9$