import sequtils,strutils,algorithm,math,sugar,macros,strformat
template times*(n:int32,body) = (for _ in 0..<n: body)
template `max=`*(x,y) = x = max(x,y)
proc getchar_unlocked():char {. importc:"getchar_unlocked",header: "<stdio.h>" .}
proc scan(): int32 =
  var minus = false
  while true:
    var k = getchar_unlocked()
    if k == '-' : minus = true
    elif k < '0' or k > '9': break
    else: result = 10 * result + k.ord.int32 - '0'.ord.int32
  if minus: result *= -1
let n = scan()
let m = scan()
let S = toSeq(stdin.readLine().items).mapIt:
  case it:
  of 'P':0
  of 'D':1
  of 'C':2
  else : 3
var DC_D = newSeq[int32]()
var DC_C = newSeq[int32]()
var CA = newSeq[int32]()
var ans = newSeq[int32](n)
m.times:
  var u = scan() - 1
  var v = scan() - 1
  if S[u] > S[v]: (u,v) = (v,u)
  if S[v] - S[u] != 1 : continue
  case S[v]:
  of 1 : ans[v] += 1
  of 2 :
    DC_D &= u
    DC_C &= v
  else : CA &= u
for i in 0..<DC_C.len: ans[DC_C[i]] += ans[DC_D[i]]
echo CA.mapIt(ans[it]).sum() mod 1000000007