#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
#define int long long
int a[2][100010], b[2][100010];
vector<int> c[100010];
int DCA[100010];
signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int ans = 0;
    int N, M; cin >> N >> M;
    string S; cin >> S;

    rep(i, M) {
        cin >> a[0][i] >> b[0][i];
        a[0][i]--; b[0][i]--;
    }
    rep(i, M) {
        a[1][i] = b[0][i];
        b[1][i] = a[0][i];
    }

    rep(j, 2) rep(i, M) if (S[a[j][i]] == 'D' && S[b[j][i]] == 'C') c[b[j][i]].push_back(a[j][i] + 1);
    rep(j, 2) rep(i, M) rep(k, c[a[j][i]].size()) if (S[b[j][i]] == 'A' && c[a[j][i]][k] != 0) DCA[c[a[j][i]][k] - 1]++;
    //rep(i, N) cout << DCA[i] << endl;
    rep(j, 2){
        rep(i, M) {
            if (S[a[j][i]] == 'P' && S[b[j][i]] == 'D') ans = (ans + DCA[b[j][i]]) % mod; 
        }
    }
    cout << ans << endl;

    return 0;
}