#include using namespace std; #define all(c) (c).begin(),(c).end() #define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--) #define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++) #define rep(i,n) REP(i,0,n) #define iter(c) __typeof((c).begin()) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) #define mem(a) memset(a,0,sizeof(a)) #define pd(a) printf("%.10f\n",a) #define pb(a) push_back(a) #define in(a) insert(a) #define pi M_PI #define R cin>> #define F first #define S second #define C class #define ll long long #define ln cout<<'\n' templatevoid pr(T a){cout<void pr(T a,T2 b){cout<void pr(T a,T2 b,T3 c){cout<void pr(T a,T2 b,T3 c,T4 d){cout<void PR(T a,ll n){rep(i,n){if(i)cout<<' ';cout<=0&&x=0&&y P; typedef pair PP; vector v[100001]; char c[100001]; ll n,d=0; P solve(int i,int p) { if(v[i].size()==1&&v[i][0].F==p) { v[i][0].S=P(n-d-(c[i]=='w'),d-(c[i]=='c')); return P(c[i]=='w',c[i]=='c'); } int k=-1; P q=P(0,0); for(int j=0; j> n >> s; rep(i,n) { c[i]=s[i]; if(s[i]=='c') d++; } rep(i,n-1) { int x,y; cin >> x >> y; x--,y--; v[x].pb(PP(y,P(-1,-1))); v[y].pb(PP(x,P(-1,-1))); } solve(0,-1); ll ans=0; rep(x,n) { if(c[x]=='w') { rep(i,v[x].size()) { P p=v[x][i].S; ans+=p.F*(d-p.S); } } } pr(ans); } int main() { ios::sync_with_stdio(0);cin.tie(0); Main();return 0; }