#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 123450
#endif

int N,M,Q;
string S;
typedef pair<int, int> E;
vector<E> G;
int D[SIZE],C[SIZE];
int MOD=1e9+7;

void solve() {
    cin>>N>>M>>S;
    int u,v;
    REP(i,M) {
        cin>>u>>v;
        u--,v--;
        if (S[u]=='D'&&S[v]=='P') D[u]++;
        if (S[v]=='D'&&S[u]=='P') D[v]++;
        if (S[u]=='C'&&S[v]=='A') C[u]++;
        if (S[v]=='C'&&S[u]=='A') C[v]++;
        G.push_back(*new E(u,v));
    }
    int ans = 0;
    for (auto p:G) {
        if (S[p.first]=='D'&&S[p.second]=='C') {
            ans += D[p.first] * C[p.second];
            ans %= MOD;
        }
        if (S[p.first]=='C'&&S[p.second]=='D') {
            ans += D[p.second] * C[p.first];
            ans %= MOD;
        }
    }
    
    cout << ans << endl;
}