#define NOMINMAX
#define TEST_MODE true

#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include "bits/stdc++.h"
#include <unordered_set>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (a)-1; i >= (int)b; --i)
#define range(i, a, b, c) for (int i = a;             \
                                   c > 0 ? i < b : i > b; \
                                   i += c)
#define chmax(a, b) (a = (a) < (b) ? (b) : (a))
#define chmin(a, b) (a = (a) > (b) ? (b) : (a))
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define all(a) begin(a), end(a)
#define ifnot(a) if (not(a))
#define int long long

#ifdef LOCAL_ENV

#if TEST_MODE == true
const bool test = true;
#define dump(x) cerr << #x << " : " << (x) << " "
#define dumpl(x) dump(x) << endl
#else
const bool test = false;
#define dump(x) 
#define dumpl(x)
#endif

#else
const bool test = false;
#define dump(x) 
#define dumpl(x)
#endif

int dx[] = { 1, 0, -1, 0 };
int dy[] = { 0, 1, 0, -1 };
const int INF = (int)1 << 60;
const int undefined = INF;
const ll INFL = (ll)1 << 60;
ll mod_n = (int)1e9 + 7;
const double eps = 1e-10;
typedef long double Real;
// return -1, 0, 1
int sgn(const Real &r) { return (r > eps) - (r < -eps); }
int sgn(const Real &a, const Real &b) { return sgn(a - b); }

//.....................
const int MAX = (int)2e5 + 5;

vector<string> split(const string &str, char sep)
{
	vector<string> v;
	stringstream ss(str);
	string buffer;
	while (getline(ss, buffer, sep))
	{
		v.push_back(buffer);
	}
	return v;
}

string join(const vector<string>& v, const string delim = 0) {
	string s;
	if (!v.empty()) {
		s += v[0];
		for (decltype(v.size()) i = 1, c = v.size(); i < c; ++i) {
			if (delim != "") s += delim;
			s += v[i];
		}
	}
	return s;
}

string operator * (const string& s, const int& n) {
	string res = "";
	rep(i, n) res += s;
	return res;
}

template <class InputIterator>
int sum(InputIterator begin, InputIterator end)
{
	return accumulate(begin, end, 0ll);
}

template<typename T>
T gcd(T a, T b)
{
	T c;
	while (a != 0) {
		c = a; a = b%a;  b = c;
	}
	return b;
}

template<typename T>
T lcm(T m, T n)
{
	return ((m / gcd(m, n)) * n);
}

template<typename T>
T bit_count(T N) {
	T cnt = 0;
	while (N) {
		if (N & 1) cnt++;
		N >>= 1;
	}
	return cnt;
}

template<typename T>
void print_vec(ostream& ostream, vector<T> a) {
	rep(i, a.size() - 1) ostream << a[i] << " ";
	ostream << a.back() << endl;
}

ll pow_n(ll x, ll n) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x;
		x = x * x;
		n >>= 1;
	}
	return res;
}

class Solver {
public:
	int H, W;

	bool grid_ng(int y, int x) {
		return y < 0 || y >= H || x < 0 || x >= W;
	}

	struct Point {
		int x, y, v;
		Point(int x_, int y_) : x(x_), y(y_) {}
		bool operator < (const Point& r) const {
			if (y != r.y) return y < r.y;
			return x < r.x;
		}
	};

	bool is_kadomatsu(vector<int> a) {
		if (a[0] == a[1] || a[0] == a[2] || a[1] == a[2])
			return false;
		if ((a[1] - a[0]) * (a[1] - a[2]) < 0)
			return false;
		return true;
	}

	int N, M;
	string S;
	vector<int> graph[MAX];

	char next(int id) {
		string PDCA = "PDCA";
		//dumpl(S[id]);
		rep(i, PDCA.size()) {
			if (PDCA[i] == S[id]) return PDCA[(i + 1) % 4];
		}
		
	}	
	
	//char pre(int id) {
	//	string PDCA = "PDCA";
	//	rep(i, PDCA.size()) {
	//		if (PDCA[i] == S[id]) return S[(i - 1 + 4) % 4];
	//	}
	//}

	int cnt_array[MAX];

	int cnt(int u) {
		//dumpl(u + 1);
		if (cnt_array[u] != -1) return cnt_array[u];
		if (S[u] == 'A') return 1;
		char next_c = next(u); //dumpl(next_c);
		int res = 0;
		for (auto& v : graph[u]) {
			if (S[v] == next_c) res += cnt(v);
		}
		return (cnt_array[u] = res) % mod_n;
	}

	void solve() {
		cin >> N >> M;
		cin >> S;
		rep(i, M) {
			int u, v;	cin >> u >> v;
			u--; v--;
			graph[u].push_back(v);
			graph[v].push_back(u);
		}
		//rep(u, N) {
		//	for (auto& v : graph[u]) {
		//		if (next(v)) cnt[u] += 1;
		//	}
		//}
		rep(i, N) cnt_array[i] = -1;
		int res = 0;
		rep(i, N) {
			if (S[i] == 'P') {
				int cnt_v = cnt(i); ////dumpl(cnt_v);
				res += cnt_v;
			}
		}
		res %= mod_n;
		cout << res << endl;
	}
};

signed main()
{
	srand((unsigned int)time(NULL));
	cout << fixed << setprecision(20);
	auto ptr = new Solver();
	ptr->solve();
	delete ptr;
	//while (true) {
	//	if (cin.eof() == true) break;
	//	auto ptr = new Solver();
	//	ptr->solve();
	//	delete ptr;
	//}
	return 0;
}