#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<string>
#include<set>
#include<vector>
using namespace std;
#define mp make_pair
#define ll long long
ll read()
{
ll f=1,x=0;
char c=getchar();
while(c>'9'||c<'0')
{
if(c=='-') f=-1;
c=getchar();
}
while(c>='0'&&c<='9')
{
x=x*10+c-'0';
c=getchar();
}
return f*x;
}
#define N 300003
int n,head[N],Size,siz[N],a[N],son[N];
ll num[N];
ll as[N],nowAs;
struct setNode{
int id;
ll x;
bool operator <(const setNode A)const
{
return x<A.x||x==A.x&&id<A.id;
}
};
vector<int>ed[N];
set<setNode>se;
struct node{
int next,to;
}mem[N<<1];
void add(int u,int v)
{
mem[++Size].to=v;mem[Size].next=head[u];head[u]=Size;
}
void dfs1(int x,int fa)
{
siz[x]=1;
for(auto v:ed[x])
{
if(v==fa) continue;
dfs1(v,x);
if(siz[v]>siz[son[x]]) son[x]=v;
siz[x]+=siz[v];
}
}
set<setNode>::iterator itl;
void ADD(setNode now)
{
if(se.empty())
{
num[now.id]=0;
se.insert(now);
return ;
}
if(se.size()==1)
{
itl=se.begin();
ll t1=itl->x-now.x;
num[itl->id]=num[now.id]=t1*t1;
nowAs=t1*t1*2;
se.insert(now);
return ;
}
itl= se.upper_bound(now);
ll tr=1e9,tl=1e9;
if(itl!=se.end())
{
tr=itl->x-now.x;
if(tr*tr<num[itl->id])
{
nowAs+=tr*tr-num[itl->id];
num[itl->id]=tr*tr;
}
}
if(itl!=se.begin())
{
--itl;
tl=now.x-itl->x;
if(tl*tl<num[itl->id])
{
nowAs+=tl*tl-num[itl->id];
num[itl->id]=tl*tl;
}
}
se.insert(now);
num[now.id]=min(tl*tl,tr*tr);
nowAs+=num[now.id];
}
void calc(int x,int fa)
{
ADD(setNode{x,a[x]});
for(auto v:ed[x])
{
if(v==fa) continue;
calc(v,x);
}
}
void dfs2(int x,int fa)
{
for(auto v:ed[x])
{
if(v==fa||v==son[x]) continue;
dfs2(v,x);
se.clear();
nowAs=0;
}
if(son[x]) dfs2(son[x],x);
ADD(setNode{x,a[x]});
for(auto v:ed[x])
{
if(v==fa||v==son[x]) continue;
calc(v,x);
}
as[x]=nowAs;
}
int main()
{
n=read();
for(int i=2;i<=n;++i)
{
int x=read();
ed[x].push_back(i);
}
for(int i=1;i<=n;++i) a[i]=read();
dfs1(1,0);
dfs2(1,0);
for(int i=1;i<=n;++i) cout<<as[i]<<'\n';
return 0;
}