#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<int>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };

ll n, m;
string s;
vector<ll>e[101010];
ll used[101010];


ll dfs(ll v,char c) {
	if (c == 'A')return 1;

	ll temp = 0;
	fore(x,e[v]) {
		if ((c == 'P' && s[x] == 'D') || (c == 'D' && s[x] == 'C') || (c == 'C' && s[x] == 'A')) {
			temp += dfs(x,s[x]);
		}
	}
	return temp;
}



int main() {
	cin >> n >> m >> s;

	rep(i, 0, m) {
		ll u, v;
		cin >> u >> v;
		u--, v--;
		e[u].pb(v);
		e[v].pb(u);
	}

	ll ans = 0;
	rep(i, 0, n) {
		if (s[i] == 'P') {
			ans += dfs(i,'P');
			ans %= MOD;
		}
	}
	cout << ans << endl;
	
	return 0;
}