#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

int main() {
  ll n, m;
  string s;
  vvl G = VV(100001, 0, 0, ll);
  vvl dp = VV(100001, 4, 0, ll);
  ll P = 1000000007;

  std::cin >> n >> m;
  std::cin >> s;
  re(i, m){
    ll a, b;std::cin >> a >> b;
    G[a-1].push_back(b-1);
    G[b-1].push_back(a-1);
  }
  for(int i=0;i<n;i++){
    if(s[i]!='C') continue;
    ll cnt = 0;
    for(auto to:G[i]){
      if(s[to]!='A') continue;
      cnt++;
    }
    dp[i][2] = cnt;
  }
  for(int i=0;i<n;i++){
    if(s[i]!='D') continue;
    for(auto to:G[i]){
      if(s[to]!='C') continue;
      dp[i][1] = (dp[i][1] + dp[to][2])%P;
    }
  }
  for(int i=0;i<n;i++){
    if(s[i]!='P') continue;
    for(auto to:G[i]){
      if(s[to]!='D') continue;
      dp[i][0] = (dp[i][0] + dp[to][1])%P;
    }
  }
  ll ans = 0;
  re(i, n) ans = (ans + dp[i][0])%P;
  std::cout << ans << '\n';
}