1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
|
#include <bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define pb push_back
#define SZ(a) ((int) a.size())
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (int i = (a); i >= (b); --i)
#define debug(var) cerr << #var <<":"<<var<<"\n";
#define lson(var) (var<<1)
#define rson(var) ((var<<1)+1)
using namespace std;
using ll = long long;using ull = unsigned long long;
using DB=double;using LD=long double;
using pdd = pair<DB,DB>;using plb = pair<ll,bool>;
using pll = pair<ll,ll>;
using arr3 = array<ll,3> ;using arr2 = array<ll,2>;
constexpr ll MAXN=static_cast<ll>(1e6)+10,INF=static_cast<ll>(1e17)+9;
constexpr ll mod=static_cast<ll>(1e9)+7;
constexpr double eps=1e-8;const double pi=acos(-1.0);
ll N,M,Q,X,K,lT;
char S[MAXN];
vector<ll> g[MAXN];
string obj="SCCPC";
ll pre[MAXN][6],suf[MAXN][6];
ll ans=0;
void dfs(ll u,ll p){
if(S[u]==obj[0]){
pre[u][0]=1;
}
if(S[u]==obj[4]){
suf[u][4]=1;
}
FOR(i,0,SZ(g[u])-1){
ll v=g[u][i];
if(v==p) continue;
dfs(v,u);
FOR(j,0,4){
ans+=pre[u][j]*suf[v][j+1];
ans+=suf[u][j]*pre[v][j-1];
}
FOR(j,0,4){
if(S[u]==obj[j]){
pre[u][j]+=pre[v][j-1];
}
}
FOR(j,0,4){
if(S[u]==obj[j]){
suf[u][j]+=suf[v][j+1];
}
}
}
}
inline void init(){
FOR(i,0,N+5){
g[i].clear();
}
ans=0;
FOR(i,0,N+5){
FOR(j,0,5){
pre[i][j]=0;
suf[i][j]=0;
}
}
}
inline void solve(){
cin>>N;
init();
FOR(i,1,N){
cin>>S[i];
}
FOR(i,1,N-1){
ll u,v;cin>>u>>v;
g[u].pb(v);
g[v].pb(u);
}
dfs(1,1);
cout<<ans<<"\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>lT;
while(lT--)
solve();
return 0;
}
|