// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;

#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
typedef pair<int, int> pii;
typedef long long ll;
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;

string pat = "PDCA";
vector<int> vs[4];
vector<int> G[100010];
int dp[100010];

signed main() {
    int N, M; string s;
    cin >> N >> M >> s;
    for(int i=0; i<N; i++) {
        vs[pat.find(s[i])].push_back(i);
    }
    for(int i=0; i<M; i++) {
        int u, v; cin >> u >> v;
        u--; v--;
        G[u].emplace_back(v);
        G[v].emplace_back(u);
    }

    for(auto v : vs[0]) dp[v] = 1;
    for(int z=1; z<4; z++) {
        char target = pat[z];
        for(auto v : vs[z-1]) {
            for(auto to : G[v]) {
                if(s[to] == target) {
                    (dp[to] += dp[v]) %= MOD;
                }
            }
        }
    }

    int ans = 0;
    for(auto v : vs[3]) (ans += dp[v]) %= MOD;
    cout << ans << endl;
    return 0;
}