#include<cstdio>

 #include<algorithm>

 #include<cstring>

 #include<cmath>

 #include<iostream>

 #include<cctype>

 #include<set>

 #include<vector>

 #include<queue>

 #include<map>

 using namespace std;

 typedef long long LL;

 inline int read() {

     int x=,f=;char ch=getchar();for(;!isdigit(ch);ch=getchar())if(ch=='-')f=-;

     for(;isdigit(ch);ch=getchar())x=x*+ch-'';return x*f;

 }

 const int N = ;

 int head[N], nxt[N], to[N], len[N], En;

 int fa[N], siz[N], son[N], dis[N], deth[N], ans[N];

 int f[( << ) + ];

 int Mx, D;

 void add_edge(int u,int v,int w) {

     ++En; to[En] = v; len[En] = w; nxt[En] = head[u]; head[u] = En;

 }

 void dfs(int u) {

     siz[u] = ;

     deth[u] = deth[fa[u]] + ;

     for (int i=head[u]; i; i=nxt[i]) {

         int v = to[i];

         fa[v] = u;

         dis[v] = dis[u] ^ ( << len[i]);

         dfs(v);

         siz[u] += siz[v];

         if (!son[u] || siz[son[u]] < siz[v]) son[u] = v;

     }

 }

 void add(int u) {

     if (f[dis[u]]) Mx = max(Mx, deth[u] + f[dis[u]] - D); // 异或后为0

     for (int i=; i<; ++i) // 异或后有一个1

         if (f[( << i) ^ dis[u]]) Mx = max(Mx, deth[u] + f[( << i) ^ dis[u]] - D);

 }

 void Calc(int u) { // 计算答案

     add(u);

     for (int i=head[u]; i; i=nxt[i]) Calc(to[i]);

 }

 void upd(int u) {

     f[dis[u]] = max(deth[u], f[dis[u]]);

 }

 void update(int u) { // 更新f数组

     upd(u);

     for (int i=head[u]; i; i=nxt[i]) update(to[i]);

 }

 void Clear(int u) {

     f[dis[u]] = ;

     for (int i=head[u]; i; i=nxt[i]) Clear(to[i]);

 }

 void solve(int u,bool c) {

     for (int i=head[u]; i; i=nxt[i])

         if (to[i] != son[u]) solve(to[i], );

     if (son[u]) solve(son[u], );

     D = deth[u] * ;

     for (int i=head[u]; i; i=nxt[i]) Mx = max(Mx, ans[to[i]]); //不经过根的

     for (int i=head[u]; i; i=nxt[i])

         if (to[i] != son[u]) Calc(to[i]), update(to[i]); // update(u) !!！ 先更新答案，在更新f数组，（防止计算到在子树内部的路径）

     add(u); upd(u);

     ans[u] = Mx;

     if (!c) Clear(u), Mx = ;

 }

 int main() {

     int n = read();

     char c[];

     for (int i=; i<=n; ++i) {

         int u = read(); scanf("%s", c);

         add_edge(u, i, c[] - 'a');

     }

     dfs();

     solve(, );

     for (int i=; i<=n; ++i) printf("%d ",ans[i]);

     return ;

 }