#include<cstdio>
#include<cctype>
#include<algorithm>
#define ll long long
using namespace std;
const int maxn=200010,maxN=2000010;
int tot,first[maxn],sz[maxn],vis[maxn],sum,root,a[maxn],u,v,n;
ll ans[maxn],t[maxN];
struct edge{int v,from;}e[maxn*2];void insert(int u,int v){tot++;e[tot].v=v;e[tot].from=first[u];first[u]=tot;}
void getroot(int x,int fa){sz[x]=1;bool ok=1;for(int i=first[x];i;i=e[i].from)if(e[i].v!=fa&&!vis[e[i].v]){getroot(e[i].v,x);sz[x]+=sz[e[i].v];if(sz[e[i].v]>sum/2)ok=0;}if(ok&&sz[x]>=sum/2)root=x;
}
void dfs(int x,int fa,int p,int s){t[s^=(1<<a[x])]+=p;for(int i=first[x];i;i=e[i].from)if(e[i].v!=fa&&!vis[e[i].v])dfs(e[i].v,x,p,s);
}
ll calc(int x,int fa,int s){s^=(1<<a[x]);ll num=t[s];for(int i=0;i<20;i++)num+=t[s^(1<<i)];for(int i=first[x];i;i=e[i].from)if(e[i].v!=fa&&!vis[e[i].v])num+=calc(e[i].v,x,s);ans[x]+=num;return num;
}
void solve(int x,int s){vis[x]=1;dfs(x,0,1,0);ll num=t[0];for(int i=0;i<20;i++)num+=t[1<<i];for(int i=first[x];i;i=e[i].from)if(!vis[e[i].v]){dfs(e[i].v,x,-1,1<<a[x]);num+=calc(e[i].v,x,0);dfs(e[i].v,x,1,1<<a[x]);}ans[x]+=num/2;dfs(x,0,-1,0);for(int i=first[x];i;i=e[i].from)if(!vis[e[i].v]){if(sz[e[i].v]>sz[x])sum=s-sz[x];else sum=sz[e[i].v];getroot(e[i].v,x);solve(root,sum);}
}
char s[maxn];
int main(){scanf("%d",&n);for(int i=1;i<n;i++){scanf("%d%d",&u,&v);insert(u,v);insert(v,u);}scanf("%s",s+1);for(int i=1;i<=n;i++)a[i]=s[i]-'a';sum=n;getroot(1,0);solve(root,sum);for(int i=1;i<=n;i++)printf("%lld ",ans[i]+1);return 0;
}