#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int n,m,hpe,ste,dee,x,y,stp,dep,q,sunshi;
char c[105][105];
int main()
{   freopen("mzq.in","r",stdin);//输入输出文件差点错了要凉 freopen("mzq.out","w",stdout);scanf("%d%d",&n,&m);for(int i=1;i<=n;i++){scanf("%s",c[i]+1);}scanf("%d%d%d",&hpe,&ste,&dee);scanf("%d%d",&x,&y);scanf("%d%d",&stp,&dep);scanf("%d",&q);for(int i=1;i<=q;i++){ int cz;scanf("%d",&cz);if(cz==1){printf("%d %d %d\n",sunshi,stp,dep);}else{  int di;scanf("%d",&di);if(di==1)y--;if(di==2)y++;if(di==3)x--;if(di==4)x++;if(c[x][y]=='Y')dep+=5;if(c[x][y]=='Q')stp+=5;if(c[x][y]=='R'){sunshi-=10;if(sunshi<0)sunshi=0;}if(c[x][y]=='M'){int rqy1=hpe/(max(1,stp-dee));if(hpe%(max(1,stp-dee)))rqy1++;int rqy2=max(1,ste-dep);sunshi+=max(1,rqy1*rqy2);}  }}return 0;
}

#include <cstdio>//用c++11写的，所以有些神奇的地方qwq

typedef long long int ll;const int maxn = 1000005;
const int MOD = 1000000007;template <typename T>//据大佬说1e5的读入要用getchar()优化
inline void qr(T &x) {char ch;do { ch = getchar(); } while ((ch > '9') || (ch < '0'));do { x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar(); } while ((ch >= '0') && (ch <= '9'));
}int n, T;
int MU[maxn], frog[maxn], gorf[maxn];
bool vis[maxn];struct Edge {int v;Edge *nxt;Edge(const int _v, Edge *h) : v(_v), nxt(h) {}
};
Edge *hd[maxn];void dfs(const int u);int main() {freopen("dzy.in", "r", stdin);freopen("dzy.out", "w", stdout);qr(n); qr(T);if (T) {for (int i = 1; i <= n; ++i) {MU[i] = i;}} else {for (int i = 1; i <= n; ++i) {MU[i] = 1;}}for (int i = 1, u, v; i < n; ++i) {u = v = 0; qr(u); qr(v);hd[u] = new Edge(v, hd[u]);hd[v] = new Edge(u, hd[v]);}dfs(1);printf("%d\n", frog[1] % MOD);return 0;
}void dfs(const int u) {vis[u] = true;//下面开始auto(c++11)(蒟蒻的电脑c++版本过低)for (auto e = hd[u]; e; e = e->nxt) if (!vis[e->v]) {int v = e->v;dfs(v);frog[u] = (frog[u] * (gorf[v] + 1ll) % MOD) + (frog[v] * (gorf[u] + 1ll) % MOD);//frog就是前面的fgorf[u] = (gorf[u] + gorf[v] + (1ll * gorf[u] * gorf[v])) % MOD;//gorf就是g
  }frog[u] = (frog[u] + MU[u]) % MOD;++gorf[u];
}

#include <cstdio>
#include <algorithm>
#include <functional>
#ifdef ONLINE_JUDGE
#define freopen(a, b, c)
#endiftypedef long long int ll;namespace IPT {//读入优化const int L = 1000000;char buf[L], *front=buf, *end=buf;char GetChar() {if (front == end) {end = buf + fread(front = buf, 1, L, stdin);if (front == end) return -1;}return *(front++);}
}template <typename T>//这个题的数据是1e7左右，要用fread,不然读入完时间就到了
inline void qr(T &x) {char ch = IPT::GetChar(), lst = ' ';while ((ch > '9') || (ch < '0')) lst = ch, ch=IPT::GetChar();while ((ch >= '0') && (ch <= '9')) x = (x << 1) + (x << 3) + (ch ^ 48), ch = IPT::GetChar();if (lst == '-') x = -x;
}const int maxn = 1000006;struct Edge {int v;Edge *nxt;Edge(const int _v, Edge *h) : v(_v), nxt(h) {}
};
Edge *hd[maxn];int n, m, k, vistime, top, scnt;
int MU[maxn], dfn[maxn], low[maxn], stack[maxn], belong[maxn], minv[maxn];//belong统计缩点后每个点的入度（有时候是一个大环的入度）
bool instack[maxn], haveind[maxn];void tarjan(const int u);int main() {freopen("zay.in", "r", stdin);freopen("zay.out", "w", stdout);qr(n); qr(m); qr(k); MU[0] = 2333;for (int i = 1; i <= n; ++i) qr(MU[i]);//读入点权for (int i = 1, u, v; i <= m; ++i) {u = v = 0; qr(u); qr(v);hd[u] = new Edge(v, hd[u]);}for (int i = 1; i <= n; ++i) if (!dfn[i]) {tarjan(i);//缩点，我们待会再扯
  }for (int u = 1; u <= n; ++u) {for (auto e = hd[u]; e; e = e->nxt) if (belong[u] != belong[e->v]) //e->nxt就是找下一条边，如果两个环的入度不相等，就满足排序取前k个点的思路是对的
{haveind[belong[e->v]] = true;//e->v就是e这条边的终点v
    }}for (int i = 1; i <= scnt; ++i) if (!haveind[i]) {MU[minv[i]] = 0;}std::nth_element(MU + 1, MU + 1 + k, MU + 1 + n,//这里是排序（取前k个的写法，也可以sort,不过这个比sort省时间） std::greater<int>());int ans = 0;for (int i = 1; i <= k; ++i) {ans += MU[i];}printf("%d\n", ans);return 0;
}void tarjan(const int u) {//缩点dfn[u] = low[u] = ++vistime;instack[stack[++top] = u] = true;for (auto e = hd[u]; e; e = e->nxt) {int v = e->v;if (!dfn[v]) {tarjan(v);low[u] = std::min(low[u], low[v]);} else if (instack[v]) {low[u] = std::min(low[u], dfn[v]);}}if (dfn[u] == low[u]) {int v, &_mv = minv[++scnt];do {instack[v = stack[top--]] = false;belong[v] = scnt;if (MU[v] < MU[_mv]) _mv = v;} while (v != u);}
}

void tarjan(const int u) {//其实就是上面那段代码的最后一部分辣dfn[u] = low[u] = ++vistime;instack[stack[++top] = u] = true;//标记是否在栈里面for (auto e = hd[u]; e; e = e->nxt) {int v = e->v;if (!dfn[v]) {tarjan(v);low[u] = std::min(low[u], low[v]);//这里考虑到v可能会有返祖边，所以取min} else if (instack[v]) {low[u] = std::min(low[u], dfn[v]);//不确保u的返祖边指向的节点比v低
    }}if (dfn[u] == low[u]) {//如果没有形成环，就不缩点int v, &_mv = minv[++scnt];do {instack[v = stack[top--]] = false;belong[v] = scnt;if (MU[v] < MU[_mv]) _mv = v;} while (v != u);//也可以直接写while循环
  }
}