Captain America needs to lead his soldiers in his war against the Red Skull. He organized his team in such a way that he can estimate his soldiers’ energy-levels and capacity at any moment, which would help him make crucial decisions as to whom to dispatch to which areas of the war.

He organized his army in the form of a hierarchy - with him as the leader. He set some rules for his war strategy -
"A has immediate superior B" if A reports directly to B.
"A has superior B" if there is a chain of soldiers starting with A,
ending with B, and where each soldier reports directly to the next
soldier of the chain.
Each soldier is assigned an initial energy-level based on prior
experience and battle proficiency.

In order for Captain to decide whom to send to which area of the war, he designed the following scheme:
He chooses a particular soldier S as the leader of his temporary
'regiment', and sends into battle, S as well as all the soldiers
that have S as one of their superiors. He estimates the energy-
level of the regiment as the total energy-level of all the soldiers
under S (denoted by query "Q S").
After the war, he may want to update the energy-levels of some
soldiers. If he wants to update the energy-level of soldier S to
value x, it is denoted by the query "U S x".

You are given the structure of the army, whose size is N, the initial energy-levels of all the individual soldiers, as well the number of queries M. For each query of the type "Q S", report the sum of energy-levels of all the soldiers who have S as their superior.

Note: The soldiers are numbered 1 to N, and Captain is given the number 1.

Input Format:

The first line consists of the integers N and M, denoting the number of soldiers and the number of queries.
This is followed by a single line consisting of N nonnegative values - the energy-levels of the N soldiers.

This is then followed by N-1 lines consisting of pairs of integers (u, v), denoting that either u is an immediate superior of v, or vice-versa.

Finally you are given the M queries, of either the form "U S x" or "Q S".

Output Format:

For each "Q S" query, output the sum of energy-levels of all the soldiers under S.

Constraints:
1 ≤ N ≤ 105
1 ≤ M ≤ 105
All energy- values given with be in the range [0, 20,000]
1 ≤ S ≤ N for all queries
All soldiers will have soldier 1 (Captain) as their superior

SAMPLE INPUT
5 8
7 2 0 5 8
1 2
2 3
2 4
1 5
Q 1
Q 2
U 2 4
Q 1
Q 2
U 5 3
Q 1
Q 2

SAMPLE OUTPUT
22
7
24
9
19
9

Explanation

Total number of soldiers is 5 with energy-levels 7, 2, 0, 5, 8. There are 8 queries. According to the relationship 1 is the immediate superior of 2 and 5. 2 in turn is the immediate superior of 3 and 4.

The queries then follow:
Q 1 - sum of energy-levels of all soldiers whose one of the superiors
is 1 including 1 himself i.e. 7+2+0+5+8=22.
Q 2 - similarly 2+0+5=7.
U 2 4 - the energy-level of soldier 2 is updated from 2 to 4.
Q 1 - 7+4+0+5+8=24.
Q 2 - 4+0+5=9.
U 5 3 - the energy-level of soldier 5 is updated from 8 to 3.
Q 1 - 7+4+0+5+3=19.
Q 2 - 4+0+5=9.

见题面

见题面