There are n cities in the volcano country, numbered from 1 to n. The city 1 is the capital of the country, called Eyjafjalla. A large volcano is located in the capital, so the temperature there is quite high. The temperature of city i is denoted by .

The n cities are connected by n-1 undirected roads. The i-th road connects city and city . If is closer to the capital than , then . The capital has the highest temperature.

The coronavirus is now spreading across the whole world. Although the volcano country is far away from the mess, Cuber QQ, the prime minister of the country, is still designing an emergency plan in case some city getting infected. Now he wants to know if a virus whose survival temperature range is [l, r] breaks out in city x, how many cities will be infected. The assumption is that, if the temperature of one city is between l and r inclusive, and it is connected to another infected city, it is infected too.

The first line contains an integer n (), representing the number of cities. 

In each of the next n-1 lines, there are two integers u,v (, ) per line, denoting that a road connecting u and v.

The next line contains n space-separated integers  (), representing the temperature in each city.

The next line contains one integer q (), representing the number of queries.

The next q lines contain one query each line. Each query is 3 space-separated integers x,l,r (), representing a query that a virus whose survival temperature range is [l, r] breaks out in city x.

For each query, output one integer representing the number of cities that will be infected. As a special case, if , please output 0.

4
1 2
1 3
2 4
10 8 7 6
3
1 10 10
2 6 7
3 7 10

1
0
3

For the third query, the virus will first land in city 3, and then infect city 1, and then infect 2, so 3 cities will be infected.