import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum MO = 10L^^9 + 7;

int N, M;
string S;
int[] U, V;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      M = readInt();
      S = readToken();
      U = new int[M];
      V = new int[M];
      foreach (i; 0 .. M) {
        U[i] = readInt() - 1;
        V[i] = readInt() - 1;
      }
      
      auto cntP = new long[N];
      auto cntA = new long[N];
      foreach (i; 0 .. M) {
        if (S[U[i]] == 'P') {
          ++cntP[V[i]];
        }
        if (S[U[i]] == 'A') {
          ++cntA[V[i]];
        }
        if (S[V[i]] == 'P') {
          ++cntP[U[i]];
        }
        if (S[V[i]] == 'A') {
          ++cntA[U[i]];
        }
      }
      long ans;
      foreach (i; 0 .. M) {
        if (S[U[i]] == 'D' && S[V[i]] == 'C') {
          ans += cntP[U[i]] * cntA[V[i]];
        }
        if (S[V[i]] == 'D' && S[U[i]] == 'C') {
          ans += cntP[V[i]] * cntA[U[i]];
        }
        ans %= MO;
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}