int N, M;
char label[100010];
int dp[100010];
vector<pair<int, int> > edge_pd, edge_dc, edge_ca;

{
    rd(N, M, label);
    REP(_, M) {
        int a, b;
        char ca, cb;
        rd(a, b);
        --a; --b;
        if (label[a] < label[b]) swap(a, b); // note: [A,C,D,P]を降順に並べるとPDCA
        
        ca = label[a];
        cb = label[b];
        
        if (ca == 'P' && cb == 'D') {
            edge_pd.push_back(make_pair(a, b));
            dp[a] = 1;
        }
        else if (ca == 'D' && cb == 'C') {
            edge_pd.push_back(make_pair(a, b));
        }
        else if (ca == 'C' && cb == 'A') {
            edge_pd.push_back(make_pair(a, b));
        }
    }
    for (auto edge : edge_pd) {
        dp[edge.second] = (dp[edge.second] + dp[edge.first]) % MD;
    }
    for (auto edge : edge_dc) {
        dp[edge.second] = (dp[edge.second] + dp[edge.first]) % MD;
    }
    int answer = 0;
    for (auto edge : edge_ca) {
        answer = (answer + dp[edge.first]) % MD;
    }
    wt(answer);
}