#include<iostream>
#include<algorithm>
#include<vector>
#include<cassert>
#include<atcoder/modint>
using namespace std;
using mint=atcoder::modint998244353;
int N;
mint Asum;
int A[1<<17],B[1<<17],C[1<<17],P[1<<17];
vector<int>G[1<<17];
mint ans;
mint dfs(int u,int p)
{
	{//u to u
		//sum[k=1..A[u]-1] k*(A[u]-k)
		ans+=mint(A[u])*A[u]*(A[u]-1)/2;
		ans-=mint(A[u])*(A[u]-1)*(2*A[u]-1)/6;
	}
	mint ch=A[u];
	vector<mint>V;
	for(int v:G[u])
	{
		mint t=dfs(v,u);
		V.push_back(t);
		ch+=t;
		{//u to v
			mint p=C[v];
			mint c=p*(p+1)/2+(A[u]-p-1)*(A[u]-p)/2;
			ans+=c*t;
		}
		{//u or pr to v or ch
			ans+=(Asum-t)*t;
		}
	}
	vector<pair<int,mint> >VP;
	for(int i=0;i<V.size();i++)
	{
		mint t=V[i];
		int v=G[u][i];
		ans+=(Asum-ch)*t*abs(B[u]-C[v]);
		VP.push_back(make_pair(C[v],t));
	}
	sort(VP.begin(),VP.end(),[](pair<int,mint>l,pair<int,mint>r){return l.first<r.first;});
	mint R=ch-A[u],L=0;
	mint cur=0;
	for(int i=0;i<VP.size();i++)
	{
		R-=VP[i].second;
		ans-=R*VP[i].first*VP[i].second;
		ans+=L*VP[i].first*VP[i].second;
		cur-=R*VP[i].first*VP[i].second;
		cur+=L*VP[i].first*VP[i].second;
		//cout<<VP[i].first<<"-"<<VP[i].second.val()<<"/"<<L.val()<<"/"<<R.val()<<" ";
		L+=VP[i].second;
	}
	//cout<<u+1<<" "<<cur.val()<<endl;
	{//u to pr
		mint t=Asum-ch;
		mint p=B[u];
		mint c=p*(p+1)/2+(A[u]-p-1)*(A[u]-p)/2;
		ans+=c*t;
	}
	return ch;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin>>N;
	for(int i=0;i<N;i++)cin>>A[i],Asum+=A[i];
	for(int i=1;i<N;i++)cin>>B[i],B[i]--;
	for(int i=1;i<N;i++)cin>>C[i],C[i]--;
	for(int i=1;i<N;i++)cin>>P[i],P[i]--;
	for(int i=1;i<N;i++)G[P[i]].push_back(i);
	dfs(0,-1);
	ans*=2;
	cout<<ans.val()<<endl;
}