給一棵樹,有三種操作:
Q a 查詢樹節點a上的值;
I a b c 將樹上a->b路徑上的節點值+c;
D a b c 將樹上a->b路徑上的節點值-c(和第二種一樣);
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<iostream>
#include<stdio.h>
#include<math.h>
#include <string>
#include<string.h>
#include<map>
#include<queue>
#include<set>
#include<utility>
#include<vector>
#include<algorithm>
#include<stdlib.h>
using namespace std;
#define eps 1e-8
#define pii pair<int,int>
#define inf 0x3f3f3f3f
#define rd(x) scanf("%d",&x)
#define rd2(x,y) scanf("%d%d",&x,&y)
#define ll long long int
#define mod 1000000007
#define maxn 100005
#define maxm 1000005
struct edge{
int to,next;
}edge[maxn*2];
int head[maxn],tot;
int top[maxn];//v所在重鏈的頂端節點
int fa[maxn];
int deep[maxn];
int num[maxn];//表示以v爲根的子樹的節點數
int p[maxn];//表示v在線段樹的位置
int fp[maxn];//
int son[maxn];//重兒子
int pos;
int v[maxn];
int maxx(int a,int b){return a>b?a:b;}
int mixx(int a,int b){return a<b?a:b;}
void init(){
tot=0;pos=1;
memset(head,-1,sizeof(head));
memset(son,-1,sizeof(son));
}
void addedge(int u,int v){
edge[tot].to=v;edge[tot].next=head[u];head[u]=tot++;
}
//第一遍dfs求fa,deep,num,son
void dfs1(int u,int pre,int d){
deep[u]=d;
fa[u]=pre;
num[u]=1;
for(int i=head[u];i!=-1;i=edge[i].next){
int v=edge[i].to;
if(v!=pre){
dfs1(v,u,d+1);
num[u]+=num[v];
if(son[u]==-1||num[v]>num[son[u]]) son[u]=v;
}
}
}
//第二遍dfs求出top和p
void getpos(int u,int sp){
top[u]=sp;
p[u]=pos++;
fp[p[u]]=u;
if(son[u]==-1) return;
getpos(son[u],sp);
for(int i=head[u];i!=-1;i=edge[i].next){
int v=edge[i].to;
if(v!=son[u]&&v!=fa[u]) getpos(v,v);
}
}
struct node{
int l,r,sum;//
}tree[maxn*3];
void build(int i,int l,int r){
tree[i].l=l;tree[i].r=r;
tree[i].sum=0;
if(l==r) {
v[l]=0;return;
}
int mid=(l+r)>>1;
build(i<<1,l,mid);
build((i<<1)|1,mid+1,r);
}
void push_down(int i){//
if(tree[i].l==tree[i].r) return;
if(tree[i].sum!=0){
if(tree[i<<1].l==tree[i<<1].r) v[tree[i<<1].l]+=tree[i].sum;
else tree[i<<1].sum+=tree[i].sum;
if(tree[(i<<1)|1].l==tree[(i<<1)|1].r) v[tree[(i<<1)|1].l]+=tree[i].sum;
else tree[(i<<1)|1].sum+=tree[i].sum;
tree[i].sum=0;
}
}
/*void push_up(int i){
tree[i].ma=maxx(tree[i<<1].ma,tree[(i<<1)|1].ma);
tree[i].mi=mixx(tree[i<<1].mi,tree[(i<<1)|1].mi);
}*/
int query(int i,int k){
if(tree[i].l==tree[i].r) return v[tree[i].l];
push_down(i);
int mid=(tree[i].l+tree[i].r)>>1;
if(k<=mid) return query(i<<1,k);
else if(k>mid) return query((i<<1)|1,k);
// else return maxx(query(i<<1,l,mid),query((i<<1)|1,mid+1,r));
}
void update(int i,int l,int r,int val){//線段樹區間l r 增加val
if(tree[i].l==l&&tree[i].r==r){
if(tree[i].l!=tree[i].r) tree[i].sum+=val;
else v[tree[i].l]+=val;
return;
}
push_down(i);
int mid=(tree[i].l+tree[i].r)>>1;
if(mid>=r) update(i<<1,l,r,val);
else if(l>mid) update((i<<1)|1,l,r,val);
else{
update(i<<1,l,mid,val);
update((i<<1)|1,mid+1,r,val);
}
}
void change(int u,int v,int val){//u->v的點增加val
int f1=top[u],f2=top[v];
// int tmp=-1000000000;
while(f1!=f2){
if(deep[f1]<deep[f2]){
swap(f1,f2);
swap(u,v);
}
update(1,p[f1],p[u],val);
u=fa[f1];f1=top[u];
}
// if(u==v) return ;
if(deep[u]>deep[v]) swap(u,v);
//return maxx(tmp,query(1,p[son[u]],p[v]));
update(1,p[u],p[v],val);
}
int t,n,m,pp,x,y,z;
int vv[maxn];
char s[10];
int main()
{
while(~scanf("%d%d%d",&n,&m,&pp)){
for(int i=1;i<=n;i++) rd(vv[i]);
init();
build(1,1,n);
for(int i=1;i<n;i++){
rd2(x,y);
addedge(x,y);addedge(y,x);
}
dfs1(1,0,0);
getpos(1,1);
for(int i=1;i<=n;i++) v[p[i]]=vv[i];
for(int i=1;i<=pp;i++){
scanf("%s",s);
if(s[0]=='I'||s[0]=='D'){
scanf("%d%d%d",&x,&y,&z);
if(s[0]=='I') change(x,y,z);
else change(x,y,-z);
}
else{
rd(x);
printf("%d\n",query(1,p[x]));
}
}
}
return 0;
}