import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def FI(): return float(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MF(): return map(float, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**16
# md = 998244353
md = 10**9+7

t = "PDCA"
n, m = MI()
s = SI()
order = [t.index(c) for c in s]
to = [[] for _ in range(n)]
for _ in range(m):
    u, v = MI1()
    if order[u]+1 == order[v]:
        to[u].append(v)
    if order[u] == order[v]+1:
        to[v].append(u)

ctou = [[] for _ in range(4)]
for u in range(n):
    ctou[order[u]].append(u)

dp = [0]*n
for u in ctou[0]: dp[u] = 1

for uu in ctou[:3]:
    for u in uu:
        dp[u] %= md
        for v in to[u]:
            dp[v] += dp[u]

ans = 0
for u in ctou[3]:
    ans += dp[u]
    ans %= md

print(ans)