#include<bits/stdc++.h>

using namespace std;

#define maxn 50005

#define lson l,m,rt<<1

#define rson m+1,r,rt<<1|1

struct Edge{int to,next;}edge[maxn<<];

int a[maxn],head[maxn],tot;

int deep[maxn],fa[maxn],son[maxn],num[maxn];

int top[maxn],fp[maxn],p[maxn],pos;

inline void addedge(int u,int v){edge[tot].to=v;edge[tot].next=head[u];head[u]=tot++;}

void dfs1(int u,int pre,int dep){

    fa[u]=pre;deep[u]=dep;num[u]=;

    for(int i=head[u];i!=-;i=edge[i].next){

        int v=edge[i].to;

        if(v==pre) continue;

        dfs1(v,u,dep+);

        num[u]+=num[v];

        if(son[u]==- || num[son[u]]<num[v]) son[u]=v;

    }

}

void getpos(int u,int sp){

    top[u]=sp;p[u]=pos++;fp[p[u]]=u;

    if(son[u]==-) return;

    getpos(son[u],sp);

    for(int i=head[u];i!=-;i=edge[i].next){

        int v=edge[i].to;

        if(v!=fa[u] && v!=son[u]) getpos(v,v);

    }

}

int seg[maxn<<];

void build(int l,int r,int rt){

    seg[rt]=;

    if(l==r) {seg[rt]=a[fp[l]];return;}//注意这里，线段树上坐标为i的点权值是第i个被访问到的点的权值

    int m=l+r>>;

    build(lson);build(rson);

}

inline void pushdown(int rt){

    if(seg[rt]) {

        seg[rt<<]+=seg[rt];

        seg[rt<<|]+=seg[rt];

        seg[rt]=;

    }

}

void update(int L,int R,int c,int l,int r,int rt){

    if(L<=l && R>=r){seg[rt]+=c;return;}

    pushdown(rt);

    int m=l+r>>;

    if(L<=m) update(L,R,c,lson);

    if(R>m) update(L,R,c,rson);

}

int query(int pos,int l,int r,int rt){

    if(l==r) return seg[rt];

    pushdown(rt);

    int m=l+r>>;

    if(pos<=m) return query(pos,lson);

    else return query(pos,rson);

}

void change(int u,int v,int c){

    int f1=top[u],f2=top[v];

    while(f1!=f2){

        if(deep[f1]<deep[f2]){swap(u,v);swap(f1,f2);}

        update(p[f1],p[u],c,,pos,);

        u=fa[f1];f1=top[u];

    }

    if(deep[u]>deep[v]) swap(u,v);

    update(p[u],p[v],c,,pos,);

}

void init(){

    tot=pos=;pos=;

    memset(head,-,sizeof head);

    memset(son,-,sizeof son);

}

int main(){

    int n,m,q,u,v,k;

    while(scanf("%d%d%d",&n,&m,&q)==){

        init();

        for(int i=;i<=n;i++)scanf("%d",&a[i]);

        for(int i=;i<=m;i++){scanf("%d%d",&u,&v);addedge(u,v);addedge(v,u);}

        dfs1(,,);getpos(,);build(,pos,);

        char op[];

        while(q--){

            scanf("%s",op);

            if(op[]=='I') {scanf("%d%d%d",&u,&v,&k);change(u,v,k);}

            else if(op[]=='D'){scanf("%d%d%d",&u,&v,&k);change(u,v,-k);}

            else {scanf("%d",&u);printf("%d\n",query(p[u],,pos,));}

        }

    }

}

#include<iostream>

#include<cstring>

#include<cstdio>

#include<algorithm>

#define MAXN 50010

using namespace std;

struct Edge{

    int to, next;

}edge[MAXN*];

int head[MAXN], tot;

int deep[MAXN];

int fa[MAXN];

int son[MAXN];

int p[MAXN];

int fp[MAXN];

int top[MAXN];

int num[MAXN];

int pos;

int c[MAXN], n;//树状数组的

void init()

{

    tot=;

    memset(head,-,sizeof(head));

    pos=;//树状数组,编号从1开始

    memset(son,-,sizeof(son));

    memset(c,,sizeof(c));

}

void addedge(int u,int v)

{

    edge[tot].to=v;edge[tot].next=head[u];head[u]=tot++;

}

void dfs1(int u, int pre, int d){

    deep[u] = d;

    fa[u] = pre;

    num[u] = ;

    for(int i = head[u]; i != -; i = edge[i].next){

        int v = edge[i].to;

        if (v != pre){//v不能是父节点

            dfs1(v, u, d+);

            num[u] += num[v];

            if (son[u]==-||num[v]>num[son[u]])

                son[u] = v;

        }

    }

}

void getpos(int u, int sp){

    top[u] = sp;

    p[u] = pos++;

    fp[p[u]] = u;

    if (son[u] == -)

        return;

    getpos(son[u], sp);

    for(int i = head[u]; i != -; i = edge[i].next){

        int v = edge[i].to;

        if (v != fa[u] && v != son[u])

            getpos(v, v);

    }

} 

//树状数组

int lowbit(int i){

    return i&(-i);

}

int sum(int i){

    int s = ;

    while(i<=n){

        s += c[i];

        i +=lowbit(i);

    }

    return s;

}

void add(int i, int val){

    while(i>){

        c[i]+=val;

        i-=lowbit(i);

    }

}

void change(int u, int v, int val){

    int f1 = top[u], f2 = top[v];

    while(f1 != f2){

        if (deep[f1]<deep[f2]){

            swap(f1, f2);

            swap(u, v);

        }

        add(p[u], val);//树状数组的区间更新原理

        add(p[f1]-, -val);//这儿得减去一个东西

        u = fa[f1];

        f1 = top[u];

    }

    if(deep[u]>deep[v])

        swap(u,v);//默认u是v的祖先

    add(p[u]-, -val);

    add(p[v], val);

}

int a[MAXN];

int main(){

    int M, P;

    while(~scanf("%d%d%d", &n, &M, &P)){

        int u, v;

        int C1, C2, K;

        char op[];

        init();

        for(int i = ; i<=n; i++)

            scanf("%d", &a[i]);

        while(M--){

            scanf("%d%d", &u, &v);

            addedge(u, v);

            addedge(v, u);

        }

        dfs1(, , );

        getpos(, );

        while(P--){

            scanf("%s", op);

            if (op[]=='Q'){

                scanf("%d", &u);

                printf("%d\n", sum(p[u])+a[u]);

            }

            else {

                scanf("%d%d%d", &C1, &C2, &K);

                if (op[]=='D')

                    K = -K;

                change(C1, C2, K);

            }

        }

    }

}