#include<bits/stdc++.h>
using namespace std;
const int N=5e5+5;
int T,n;
struct node{
    int to,nxt;
}e[N];
int cnt,head[N];
void add(int u,int v){
    e[++cnt].to=v;
    e[cnt].nxt=head[u];
    head[u]=cnt;
}
int rd() {
	int r = 0; bool w = false; char ch = getchar();
	while( ch < '0' || ch > '9' ) w = !(ch^45), ch = getchar();
	while( ch >= '0' && ch <= '9' ) r = (r<<1) + (r<<3) + (ch^48), ch = getchar();
	return w ? -r : r;
}
int a[N];
int dep[N];
void dfs(int u,int Dep){
    dep[Dep]++;
    for(int i=head[u];i;i=e[i].nxt){
        int v=e[i].to;
        dfs(v,Dep+1);
    }
}
void solve(){
    n=rd();cnt=0;
    for(int i=1;i<=n;i++) head[i]=0;
    for(int i=1,x;i<n;i++){
        x=rd();add(x,i+1);
    }
    dep[0]=0;
    for(int i=1;i<=n;i++){
        a[i]=rd();
        a[i]=-i-a[i];
        dep[i]=0;
    }
    sort(a+1,a+1+n);
    dfs(1,0);
    int now=0,ans=0;
    for(int i=1;i<=n;i++){
        while(dep[now]==0) now++;
        ans=max(ans,now-a[i]);
        dep[now]--;
    }
    printf("%d\n",ans);

}
int main(){
    scanf("%d",&T);
    while(T--) solve();
}