MLE,但是MLE的数据点在本地测试能输出正确答案。太玄学了！

#include<bits/stdc++.h>
#define add(u,v) to[++cnt]=v,nt[cnt]=hd[u],hd[u]=cnt
#define ll long long
using namespace std;
const int N=1e5+10;
const ll inf=1e13+10;
int n,t;
ll a[N],w[N],f[N];
int fa[N],hd[N],to[N],nt[N],cnt;
bool check(int u,ll k){
	ll sum=0;
	for(int e=hd[u];e;e=nt[e]){
		int v=to[e];
		sum+=max(0ll,w[v]+k);
	}
	return sum<=k;
}
void dfs(int u){
	if(!hd[u])return void(f[u]=inf);
	ll sum=0,mink=inf;
	for(int e=hd[u];e;e=nt[e]){
		int v=to[e];
		dfs(v);
		sum+=f[v],mink=min(mink,f[v]-w[v]);
	}
	ll l=0,r=min(sum,mink);
	while(l<r){
		ll mid=l+r>>1;
		if(check(u,mid+1))l=mid+1;
		else r=mid;
	}
	f[u]=l;
}
bool solve(){
	cin>>n;
	memset(hd+1,0,(n+10)*sizeof(int));
	for(int i=2;i<=n;++i)cin>>fa[i],add(fa[i],i);
	for(int i=1;i<=n;++i)cin>>a[i];
	w[1]=a[1];
	for(int i=2;i<=n;++i){
		w[i]=a[i]-a[fa[i]];
		if(w[i]>0)return 0;
	}
	if(w[1]<=0)return 1;
	dfs(1);
	return f[1]>=w[1];
}
int main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin.ignore(10,'\n')>>t;
	while(t--)
		cout<<(solve()?"Huoyu\n":"Shuiniao\n");
	return 0;
}