#include<cstdio>
#include<cstring>
#include<algorithm>
bool isdigit(char c){return c>='0'&&c<='9';}
int read(){int s=0,t=1;char c;while(!isdigit(c=getchar()))if(c=='-')t=-1;do{s=s*10+c-'0';}while(isdigit(c=getchar()));return s*t;
}
using namespace std;
const int maxn=500010,inf=0x3f3f3f3f;
int n,sz[maxn],first[maxn],a[maxn],b[30],c[5000010],ans[maxn],w[maxn],fa[maxn],tot,deep[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 p(int &x,int y){if(x<y)x=y;}
void dfs_pre(int x){sz[x]=1;for(int i=first[x];i;i=e[i].from){deep[e[i].v]=deep[x]+1;a[e[i].v]^=a[x];dfs_pre(e[i].v);sz[x]+=sz[e[i].v];if(sz[e[i].v]>sz[w[x]])w[x]=e[i].v;}
}
void calc(int x,int tp){for(int j=0;j<=22;j++)p(ans[tp],deep[x]+c[a[x]^b[j]]);for(int i=first[x];i;i=e[i].from)calc(e[i].v,tp);
}
void add(int x,int k){if(k)p(c[a[x]],deep[x]);else c[a[x]]=-inf;for(int i=first[x];i;i=e[i].from)add(e[i].v,k);
}
void dfs(int x){for(int i=first[x];i;i=e[i].from)if(e[i].v!=w[x])dfs(e[i].v);if(w[x])dfs(w[x]);//
    p(c[a[x]],deep[x]);for(int j=0;j<=22;j++)p(ans[x],deep[x]+c[a[x]^b[j]]);for(int i=first[x];i;i=e[i].from)if(e[i].v!=w[x])calc(e[i].v,x),add(e[i].v,1);if(x!=w[fa[x]])add(x,0);
}
char s[10];
int main(){n=read();for(int i=2;i<=n;i++){fa[i]=read();if(fa[i])insert(fa[i],i);scanf("%s",s);a[i]=1<<(s[0]-'a');}b[22]=0;for(int j=0;j<=21;j++)b[j]=1<<j;for(int i=0;i<(1<<22);i++)c[i]=-inf;dfs_pre(1);dfs(1);for(int i=1;i<=n;i++)ans[i]-=2*deep[i];for(int i=n;i>=1;i--)p(ans[fa[i]],ans[i]);for(int i=1;i<=n;i++)printf("%d ",ans[i]);return 0;
}