#include #define rep(i, n) for (int i = 0; i < int(n); i++) #define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--) #define reps(i, n) for (int i = 1; i <= int(n); i++) #define rreps(i, n) for (int i = int(n); i >= 1; i--) #define repc(i, n) for (int i = 0; i <= int(n); i++) #define rrepc(i, n) for (int i = int(n); i >= 0; i--) #define repi(i, a, b) for (int i = int(a); i < int(b); i++) #define repic(i, a, b) for (int i = int(a); i <= int(b); i++) #define each(x, y) for (auto &x : y) #define all(a) (a).begin(), (a).end() #define bit(b) (1ll << (b)) using namespace std; using i32 = int; using i64 = long long; using u64 = unsigned long long; using f80 = long double; using vi32 = vector; using vi64 = vector; using vu64 = vector; using vf80 = vector; using vstr = vector; inline void yes() { cout << "Yes" << '\n'; exit(0); } inline void no() { cout << "No" << '\n'; exit(0); } inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); } inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; } inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); } template class pqasc : public priority_queue, greater> {}; template class pqdesc : public priority_queue, less> {}; template inline void amax(T &x, T y) { if (x < y) x = y; } template inline void amin(T &x, T y) { if (x > y) x = y; } template inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; } template inline T bis(T ok, T ng, function f, T eps = 1) { while (abs(ok - ng) > eps) { T mi = (ok + ng) / 2; (f(mi) ? ok : ng) = mi; } return ok; } template istream& operator>>(istream &is, vector &v) { each(x, v) is >> x; return is; } template ostream& operator<<(ostream &os, vector &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; } template istream& operator>>(istream &is, pair &p) { is >> p.first >> p.second; return is; } template ostream& operator<<(ostream &os, pair &p) { os << p.first << ' ' << p.second; return os; } void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; } template struct ModInt { int x; ModInt(): x(0) {} ModInt(long long a) { x = a % mod; if (x < 0) x += mod; } ModInt &operator+=(ModInt that) { x = (x + that.x) % mod; return *this; } ModInt &operator-=(ModInt that) { x = (x + mod - that.x) % mod; return *this; } ModInt &operator*=(ModInt that) { x = (long long) x * that.x % mod; return *this; } ModInt &operator/=(ModInt that) { return *this *= that.inverse(); } ModInt inverse() { int a = x, b = mod, u = 1, v = 0; while (b) { int t = a / b; a -= t * b; u -= t * v; swap(a, b); swap(u, v); } return ModInt(u); } #define op(o, p) ModInt operator o(ModInt that) { return ModInt(*this) p that; } op(+, +=) op(-, -=) op(*, *=) op(/, /=) #undef op friend ostream& operator<<(ostream &os, ModInt m) { return os << m.x; } }; using mint = ModInt<1000000007>; mint dp[100001]; void solve() { int n, m; cin >> n >> m; rep(i, n) dp[i].x = -1; string s; cin >> s; vector edges(n); rep(i, m) { int u, v; cin >> u >> v; u--, v--; edges[u].push_back(v); edges[v].push_back(u); } function dfs = [&](int u, int p) { if (dp[u].x != -1) return dp[u]; char x; switch (s[u]) { case 'P': x = 'D'; break; case 'D': x = 'C'; break; case 'C': x = 'A'; break; case 'A': return (mint) 1; } mint ret = 0; each(v, edges[u]) { if (v == p) continue; if (s[v] != x) continue; ret += dfs(v, u); } return dp[u] = ret; }; mint ans = 0; rep(i, n) { if (s[i] == 'P') ans += dfs(i, -1); } cout << ans << endl; }