void dfs1(int o, int u){sz[u] = 1;for(int i = head[u]; ~i; i = nt[i]){int v = to[i];if(v == o) continue;dfs1(u, v);if(sz[v] > sz[son[u]]) son[u] = v;sz[u] += sz[v];}
}

void dfs2(int o, int u, int t){deep[u] = deep[o] + 1;top[u] = t;fa[u] = o;dfn[u] = ++dtot;dto[dtot] = u;if(son[u]) dfs2(u, son[u], t);for(int i = head[u]; ~i; i = nt[i]){int v = to[i];if(v == o || v == son[u]) continue;dfs2(u, v, v);}
}

void Updata_Path(int x, int y, int c){int fx = top[x], fy = top[y];while(fx != fy){if(deep[fx] > deep[fy]){Updata(dfn[fx],dfn[x],c,1,n,1);x = fa[fx]; fx = top[x];}else {Updata(dfn[fy],dfn[y],c,1,n,1);y = fa[fy]; fy = top[y];}}if(deep[x] < deep[y]) Updata(dfn[x], dfn[y], c, 1, n, 1);else Updata(dfn[y], dfn[x], c, 1, n,1);
}

/*
code by: zstu wxk
time: 2019/02/22
*/
#include<bits/stdc++.h>
using namespace std;
#define Fopen freopen("_in.txt","r",stdin); freopen("_out.txt","w",stdout);
#define LL long long
#define ULL unsigned LL
#define fi first
#define se second
#define pb push_back
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define lch(x) tr[x].son[0]
#define rch(x) tr[x].son[1]
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
typedef pair<int,int> pll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const LL _INF = 0xc0c0c0c0c0c0c0c0;
const LL mod =  (int)1e9+7;
const int N = 2e5 + 100;
int n, m, p;
int tr[N<<2], lz[N<<2], a[N];
int head[N], nt[N], to[N], tot;
int sz[N], son[N];
int top[N], fa[N], dfn[N], dto[N], deep[N], dtot;
void Build(int l, int r, int rt){lz[rt] = tr[rt] = 0;if(l == r){tr[rt] = a[dto[l]];return ;}int m = l+r >> 1;Build(lson); Build(rson);return ;
}
void PushDown(int rt){if(lz[rt]){lz[rt<<1] += lz[rt];lz[rt<<1|1] += lz[rt];tr[rt<<1] += lz[rt];tr[rt<<1|1] += lz[rt];lz[rt] = 0;}return ;
}
void add(int u, int v){to[tot] = v;nt[tot] = head[u];head[u] = tot++;
}
void dfs1(int o, int u){sz[u] = 1;for(int i = head[u]; ~i; i = nt[i]){int v = to[i];if(v == o) continue;dfs1(u, v);if(sz[v] > sz[son[u]]) son[u] = v;sz[u] += sz[v];}
}
void dfs2(int o, int u, int t){deep[u] = deep[o] + 1;top[u] = t;fa[u] = o;dfn[u] = ++dtot;dto[dtot] = u;if(son[u]) dfs2(u, son[u], t);for(int i = head[u]; ~i; i = nt[i]){int v = to[i];if(v == o || v == son[u]) continue;dfs2(u, v, v);}
}
int Query(int x, int l, int r, int rt){if(l == r)return tr[rt];int m = l+r >> 1;PushDown(rt);if(x <= m) return Query(x, lson);return Query(x, rson);
}
void Updata(int L, int R, int C, int l, int r, int rt){
//    cout << L << " l with r " << r <<  endl;if(L <= l && r <= R){lz[rt] += C;tr[rt] += C;return ;}int m = l+r >> 1;PushDown(rt);if(L <= m) Updata(L, R, C, lson);if(m < R) Updata(L, R, C, rson);return ;
}
void Updata_Path(int x, int y, int c){int fx = top[x], fy = top[y];while(fx != fy){if(deep[fx] > deep[fy]){Updata(dfn[fx],dfn[x],c,1,n,1);x = fa[fx]; fx = top[x];}else {Updata(dfn[fy],dfn[y],c,1,n,1);y = fa[fy]; fy = top[y];}}if(deep[x] < deep[y]) Updata(dfn[x], dfn[y], c, 1, n, 1);else Updata(dfn[y], dfn[x], c, 1, n,1);
}
void init(){memset(head, -1, sizeof(head));memset(son, 0, sizeof son);tot = dtot = 0;
}
void Ac(){for(int i = 1; i <= n; ++i) scanf("%d", &a[i]);for(int i = 1,u,v; i < n; ++i){scanf("%d%d", &u, &v);add(u, v); add(v, u);}dfs1(1,1);dfs2(1,1,1);Build(1,n,1);char op[5];int x, y, c;for(int i = 1; i <= p; ++i){scanf("%s", op);if(op[0] == 'Q') {scanf("%d", &x);printf("%d\n", Query(dfn[x], 1, n, 1));}else {scanf("%d%d%d", &x, &y, &c);if(op[0] == 'D') c = -c;Updata_Path(x,y,c);
//            Tdfs(1,n,1);
         }}
}
int main(){while(~scanf("%d%d%d", &n, &m, &p)){init();Ac();}return 0;
}
/*
3 2 5
1 2 3
2 1
1 3
I 2 3 5
Q 27 6 10
0 0 0 0 0 0 0
1 2
2 3
3 4
1 5
5 6
I 4 6 1
Q 1*/