B"There are n cities in the country. Two candidates are fighting for the post of the President. The elections are set in the future, and both candidates have already planned how they are going to connect the cities with roads. Both plans will connect all cities using n - 1 roads only. That is, each plan can be viewed as a tree. Both of the candidates had also specified their choice of the capital among n cities ( x for the first candidate and y for the second candidate), which may or may not be same. Each city has a potential of building a port (one city can have at most one port). Building a port in i -th city brings a_i amount of money. However, each candidate has his specific demands. The demands are of the form: Find out the maximum revenue that can be gained while fulfilling all demands of both candidates, or print -1 if it is not possible to do. It is additionally guaranteed, that each candidate has specified the port demands for the capital of his choice. The first line contains integers n , x and y ( 1 <= n <= 500 , 1 <= x, y <= n ) -- the number of cities, the capital of the first candidate and the capital of the second candidate respectively. Next line contains integers a_1, a_2, ldots, a_n ( 1 <= a_i <= 100 ,000 ) -- the revenue gained if the port is constructed in the corresponding city. Each of the next n - 1 lines contains integers u_i and v_i ( 1 <= u_i, v_i <= n , u_i ne v_i ), denoting edges between cities in the tree of the first candidate. Each of the next n - 1 lines contains integers u'_i and v'_i ( 1 <= u'_i, v'_i <= n , u'_i ne v'_i ), denoting edges between cities in the tree of the second candidate. Next line contains an integer q_1 ( 1 <= q_1 <= n ), denoting the number of demands of the first candidate. Each of the next q_1 lines contains two integers k and x"...