/* ---------- STL Libraries ---------- */ // IO library #include #include #include #include #include // algorithm library #include #include #include #include // container library #include #include #include #include #include #include #include #include #include /* ---------- Namespace ---------- */ using namespace std; /* ---------- Type Abbreviation ---------- */ using ll = long long; template using PQ = priority_queue; template using GPQ = priority_queue, greater>; #define mp make_pair #define mt make_tuple /* ---------- conversion ---------- */ #define INT(c) static_cast(c) #define CHAR(n) static_cast(n) #define LL(n) static_cast(n) #define DOUBLE(n) static_cast(n) /* ---------- container ---------- */ #define gsort(b, e) sort(b, e, greater()) /* ----------- debug ---------- */ template ostream& operator<<(ostream& os, vector v) { os << "["; for (auto vv : v) os << vv << ","; return os << "]"; } template ostream& operator<<(ostream& os, set v) { os << "["; for (auto vv : v) os << vv << ","; return os << "]"; } template ostream& operator<<(ostream& os, pair p) { return os << "(" << p.first << "," << p.second << ")"; } /* ---------- Constants ---------- */ const ll MOD = 1e9 + 7; // const int INF = 1 << 25; // const ll INF = 1LL << 50; // const double PI = acos(-1); // const double EPS = 1e-10; // mt19937 mert(LL(time(0))); /* ---------- Short Functions ---------- */ template inline T sq(T a) { return a * a; } template T gcd(T a, T b) { if (a > b) return gcd(b, a); return a == 0 ? b : gcd(b % a, a); } template T mypow(T b, U n) { if (n == 0) return 1; if (n == 1) return b /* % MOD */; if (n % 2 == 0) { return mypow(b * b /* % MOD */, n / 2); } else { return mypow(b, n - 1) * b /* % MOD */; } } ll pcnt(ll b) { return __builtin_popcountll(b); } /* v-v-v-v-v-v-v-v-v Main Part v-v-v-v-v-v-v-v-v */ const string PDCA = "PDCA"; int main() { int N, M; cin >> N >> M; string S; cin >> S; vector path[N]; for (int i = 0; i < M; ++i) { int u, v; cin >> u >> v; --u, --v; path[u].push_back(v); path[v].push_back(u); } ll dp[4][N]; fill(dp[0], dp[4], 0); for (int v = 0; v < N; ++v) { if (S[v] == PDCA[0]) dp[0][v] = 1; } for (int k = 1; k < 4; ++k) { for (int v = 0; v < N; ++v) { if (S[v] != PDCA[k]) continue; for (int sv : path[v]) { dp[k][v] += dp[k - 1][sv]; } dp[k][v] %= MOD; } } ll ans = 0; for (int v = 0; v < N; ++v) { ans += dp[3][v]; } cout << ans % MOD << endl; return 0; }