#define _CRT_SECURE_NO_DEPRECATE
#include<stdio.h>
#include<string.h>
#include<cstring>
#include<algorithm>
#include<queue>
#include<math.h>
#include<time.h>
#include<vector>
#include<iostream>
#include<map>
using namespace std;
typedef long long int LL;
const int MAXN = 100000 + 10;
struct Edges{int u, v; LL w;Edges(int u = 0, int v = 0,LL w=0) :u(u), v(v),w(w){};
};vector<Edges>G[MAXN];
map<pair<int, int>, LL>edge;
struct Node{int val;LL W, B;Node(int val = 0, LL W = 0, LL B = 0) :val(val), W(W), B(B){};
}node[MAXN];
LL ansWB, ansWW, ansBB;
int du[MAXN], block;
void init(int n,int m){edge.clear(); ansWB = ansWW = ansBB = 0;block = (int)sqrt(m + 0.5);for (int i = 1; i <= n; i++){G[i].clear(); du[i] = 0; node[i].W = node[i].B = 0;}
}
void makeGraph(int n, int m){for (map<pair<int,int>,LL>::iterator it=edge.begin(); it!=edge.end(); it++){int u = it->first.first, v = it->first.second; LL w = it->second;if (du[u] >= block&&du[v] >= block){G[u].push_back(Edges(u, v, w)); G[v].push_back(Edges(v, u, w));}if (du[u] < block){G[u].push_back(Edges(u, v, w));}if (du[v] < block){G[v].push_back(Edges(v, u, w));}if (node[u].val&&node[v].val){ansWW += w; node[u].W += w; node[v].W += w;}else if (!node[u].val&&!node[v].val){ansBB += w; node[u].B += w; node[v].B += w;}else{ansWB += w; if (node[u].val){node[u].B += w; node[v].W += w;}else{node[u].W += w; node[v].B += w;}}}
}
void modify(int pos){if (node[pos].val){ansWW -= node[pos].W; ansWB -= node[pos].B;ansBB += node[pos].B; ansWB += node[pos].W;for (int i = 0; i < G[pos].size(); i++){node[G[pos][i].v].W -= G[pos][i].w;node[G[pos][i].v].B += G[pos][i].w;}}else{ansBB -= node[pos].B; ansWB -= node[pos].W;ansWW += node[pos].W; ansWB += node[pos].B;for (int i = 0; i < G[pos].size(); i++){node[G[pos][i].v].W += G[pos][i].w;node[G[pos][i].v].B -= G[pos][i].w;}}node[pos].val = !node[pos].val;
}
LL query(int u, int v){if (u&&v){ return ansWW; }if (!u&&!v){ return ansBB; }return ansWB;
}
int main(){//#ifdef kirito//    freopen("in.txt", "r", stdin);//    freopen("out.txt", "w", stdout);//#endifint n, m, q,Case=1;while (~scanf("%d%d", &n, &m)){init(n, m);for (int i = 1; i <= n; i++)scanf("%d", &node[i].val);for (int i = 1; i <= m; i++){int u, v; LL w; scanf("%d%d%I64d", &u, &v, &w);if (u > v){ swap(u, v); }if (edge.find(make_pair(u, v)) == edge.end()){du[u]++; du[v]++;edge.insert(make_pair(make_pair(u, v), w));}else{edge[make_pair(u, v)] += w;}}makeGraph(n, m);printf("Case %d:\n", Case++);scanf("%d", &q);while (q--){int u,v;  char type[20];scanf("%s", type);if (type[0]=='A'){scanf("%d%d", &u, &v);printf("%I64d\n", query(u, v));}else{scanf("%d", &u); modify(u);}//Debug:printf("BB=%I64d WB=%I64d WW=%I64d\n", ansBB, ansWB, ansWW);
        }}return 0;
}