#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define fuck cout << "wtf?????\n"
using namespace std;
const int maxn = 50009;
int n, m, p, tot, num, be;
int value[maxn], top[maxn], depth[maxn], father[maxn], son[maxn], ap[maxn], fap[maxn], head[maxn], node_size[maxn];
bool vis[maxn];
inline void Init()
{
tot = num = 0;
memset(head, -1, sizeof(head));
memset(vis, false, sizeof(vis));
memset(son, -1, sizeof(son));
}
struct Edge
{
int to;
int next;
}edge[maxn << 1];
inline void add(int u, int v)
{
edge[tot].to = v;
edge[tot].next = head[u];
head[u] = tot++;
}
///树链剖分
void dfs(int u, int fa, int deep) ///计算树链剖分所需要的信息
{
father[u] = fa;
depth[u] = deep;
node_size[u] = 1;
for(int i = head[u]; i != -1; i = edge[i].next)
{
int to = edge[i].to;
if(to == fa)
continue;
dfs(to, u, deep + 1);
node_size[u] += node_size[to];
if(son[u] == -1 || node_size[to] > node_size[son[u]])
{
son[u] = to;
}
}
}
void getlist(int u, int tp) ///连边成链
{
ap[u] = ++num;
fap[ap[u]] = u;
top[u] = tp;
if(son[u] != -1)
getlist(son[u], tp);
else
return ;
for(int i = head[u]; i != -1; i = edge[i].next)
{
int to = edge[i].to;
if(to != son[u] && to != father[u])
{
getlist(to, to);
}
}
}
///树链剖分到此结束
///-------------------------------------------
///线段树
int Tree[maxn << 2], lazy[maxn << 2];
void push_up(int rt)
{
Tree[rt] = Tree[rt << 1] + Tree[rt << 1 | 1];
}
void Build(int l, int r, int rt)
{
lazy[rt] = 0;
if(l == r)
{
Tree[rt] = value[fap[l]];
return ;
}
int m = (l + r) >> 1;
Build(l, m, rt << 1);
Build(m + 1, r, rt << 1 | 1);
push_up(rt);
}
void push_down(int l, int r, int rt)
{
if(lazy[rt] == 0)
return ;
int m = (l + r) >> 1;
Tree[rt << 1] += lazy[rt] * (m - l + 1);
lazy[rt << 1] += lazy[rt];
Tree[rt << 1 | 1] += lazy[rt] * (r - (m + 1) + 1);
lazy[rt << 1 | 1] += lazy[rt];
lazy[rt] = 0;
}
void update(int L, int R, int val, int l, int r, int rt)
{
if(l >= L && r <= R)
{
Tree[rt] += val * (r - l + 1);
lazy[rt] += val;
return ;
}
int m = (l + r) / 2;
push_down(l, r, rt);
if(m >= L)
update(L, R, val, l, m, rt << 1);
if(m < R)
update(L, R, val, m + 1, r, rt << 1 | 1);
push_up(rt);
}
int Query(int pos, int l, int r, int rt)
{
if(l == r && pos == l)
{
return Tree[rt];
}
int m = (l + r) / 2;
push_down(l, r, rt);
if(m >= pos)
return Query(pos, l, m, rt << 1);
else
return Query(pos, m + 1, r, rt << 1 | 1);
}
///线段树到此结束
void Revise(int u, int v, int k)
{
int f1 = top[u], f2 = top[v];
while(f1 != f2)
{
if(depth[f1] < depth[f2])
{
swap(f1, f2);
swap(u, v);
}
update(ap[f1], ap[u], k, 1, n, 1);
u = father[f1];
f1 = top[u];
}
if(depth[u] < depth[v])
swap(u, v);
update(ap[v], ap[u], k, 1, n, 1);
}
void Check(int l, int r, int rt)
{
if(l == r)
{
cout << fap[l] << ' ' << Tree[rt] << endl;
return ;
}
int m = (l + r) / 2;
Check(l, m, rt << 1);
Check(m + 1, r, rt << 1 | 1);
}
int main()
{
//freopen("in.txt", "r",stdin);
while(cin >> n >> m >> p)
{
Init();
for(int i = 1; i <= n; ++ i)
{
scanf("%d", &value[i]);
}
int u, v;
for(int i = 1; i <= m; ++ i)
{
scanf("%d%d", &u, &v);
vis[v] = true;
add(u, v);
add(v, u);
}
dfs(1, 0, 0);
getlist(1, 1);
Build(1, n, 1);
//cout << n << ' ' << m << ' ' << p << endl;
char str[10];
for(int i = 1; i <= p; ++ i)
{
int k;
scanf("%s", str);
if(str[0] == 'I')
{
scanf("%d%d%d", &u, &v, &k);
Revise(u, v, k);
//Check(1, n, 1);
}
else if(str[0] == 'D')
{
scanf("%d%d%d", &u, &v, &k);
Revise(u, v, -k);
}
else
{
scanf("%d", &u);
printf("%d\n", Query(ap[u], 1, n, 1));
}
}
}
return 0;
}