#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())

ll n, m;
string s;
vector<vector<ll>> g;
vector<ll> dp;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    const ll mod = 1e9 + 7;
    cin >> n >> m;
    cin >> s;
    g.resize(n);
    rep(i, m) {
        ll a, b;
        cin >> a >> b;
        a--; b--;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    dp.resize(n, 0);
    rep(i, n) {
        if (s[i] == 'A') dp[i] = 1;
    }
    rep(i, n) {
        if (s[i] != 'C') continue;
        for(auto u : g[i]) {
            if (s[u] != 'A') continue;
            dp[i] = (dp[i] + dp[u]) % mod;
        }
    }
    rep(i, n) {
        if (s[i] != 'D') continue;
        for(auto u : g[i]) {
            if (s[u] != 'C') continue;
            dp[i] = (dp[i] + dp[u]) % mod;
        }
    }
    ll ans = 0;
    rep(i, n) {
        if (s[i] != 'P') continue;
        for(auto u : g[i]) {
            if (s[u] != 'D') continue;
            dp[i] = (dp[i] + dp[u]) % mod;
        }
        ans = (ans + dp[i]) % mod;
    }
    cout << ans << endl;
    return 0;
}