#include using namespace std; using namespace std::chrono; typedef long long ll; typedef pair pii; typedef pair pdd; #define _overload4(_1,_2,_3,_4,name,...) name #define _overload3(_1,_2,_3,name,...) name #define _rep1(n) _rep2(i,n) #define _rep2(i,n) _rep3(i,0,n) #define _rep3(i,a,b) for(ll i=a;i=a;i--) #define _rrep4(i,a,b,c) for(ll i=a+(b-a-1)/c*c;i>=a;i-=c) #define rrep(...) _overload4(__VA_ARGS__,_rrep4,_rrep3,_rrep2,_rrep1)(__VA_ARGS__) #define each(i,a) for(auto&& i:a) #define sum(...) accumulate(range(__VA_ARGS__),0LL) #define _range(i) (i).begin(),(i).end() #define _range2(i,k) (i).begin(),(i).begin()+k #define _range3(i,a,b) (i).begin()+a,(i).begin()+b #define range(...) _overload3(__VA_ARGS__,_range3,_range2,_range)(__VA_ARGS__) const ll LINF=0x3fffffffffffffff; const ll MOD=1000000007; const ll MODD=0x3b800001; const int INF=0x3fffffff; const vector four={{0,1},{1,0},{0,-1},{-1,0}}; #define yes(i) out(i?"yes":"no") #define Yes(i) out(i?"Yes":"No") #define YES(i) out(i?"YES":"NO") #define Possible(i)out(i?"Possible":"Impossible") #define unless(a) if(!(a)) #define elif else if //#define START auto start=system_clock::now() //#define END auto end=system_clock::now();cerr<(end-start).count()<<" ms\n" #define INT(...) int __VA_ARGS__;in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;in(__VA_ARGS__) #define STR(...) string __VA_ARGS__;in(__VA_ARGS__) #define CHR(...) char __VA_ARGS__;in(__VA_ARGS__) #define DBL(...) double __VA_ARGS__;in(__VA_ARGS__) #define vec(type,name,...) vector name(__VA_ARGS__); #define VEC(type,name,size) vector name(size);in(name) #define vv(type,name,h,...) vector>name(h,vector(__VA_ARGS__)) #define pll pair struct SETTINGS{SETTINGS(){cin.tie(0); cout.tie(0); ios::sync_with_stdio(0); cout< inline bool update_min(T& mn,const T& cnt){if(mn>cnt){mn=cnt;return 1;}else return 0;} template inline bool update_max(T& mx,const T& cnt){if(mx inline T min(vector& vec){return *min_element(range(vec));} template inline T max(vector& vec){return *max_element(range(vec));} template inline constexpr T gcd (T a,T b) {if(a==b)return a;else return gcd(b,(a-1)%b+1);} inline constexpr ll POW(ll a,ll b){if(b==1)return a;ll ans=POW(a,b/2);ans*=ans;if(b&1)ans*=a;return ans;} inline constexpr ll MODPOW(ll a,ll b,ll mod){if(a>=mod)a%=mod;if(b==1)return a;ll ans=MODPOW(a,b/2,mod);ans*=ans;ans%=mod;if(b&1){ans*=a;ans%=mod;}return ans;} inline void in() {} template istream& operator >> (istream& is, vector& vec); template istream& operator >> (istream& is, array& vec); template istream& operator >> (istream& is, pair& p); template ostream& operator << (ostream& os, vector& vec); template ostream& operator << (ostream& os, pair& p); template istream& operator >> (istream& is, vector& vec){for(T& x: vec) is >> x;return is;} template istream& operator >> (istream& is, pair& p){is >> p.first;is >> p.second;return is;} template ostream& operator << (ostream& os, vector& vec){os << vec[0];rep(i,1,vec.size()){os << ' ' << vec[i];}return os;} template ostream& operator << (ostream& os, deque& vec){os << vec[0];rep(i,1,vec.size()){os << ' ' << vec[i];}return os;} template ostream& operator << (ostream& os, pair& p){os << p.first << " " << p.second;return os;} template inline void in(Head&& head,Tail&&... tail){cin>>head;in(move(tail)...);} template inline void out(T t){cout< inline void out(Head head,Tail... tail){cout<,d,n); mapto_i; to_i['P']=0; to_i['D']=1; to_i['C']=2; to_i['A']=3; vec(ll,cnt,n); rep(m){ LL(a,b); a--; b--; if(to_i[s[a]]-to_i[s[b]]==1)d[b].push_back(a); elif(to_i[s[b]]-to_i[s[a]]==1)d[a].push_back(b); } rep(n)if(s[i]=='C')cnt[i]=d[i].size(); rep(n)if(s[i]=='D')each(j,d[i])cnt[i]=(cnt[i]+cnt[j])%MOD; ll ans=0; rep(n)if(s[i]=='P')each(j,d[i])ans=(ans+cnt[j])%MOD; out(ans); }