rt

#include<cstdio>
#define int long long
#define mod 998244353
const int N=2e6+10;
int n,a[N],head[N],dp[N],f[N],cnt,num[N],siz[N],ans;
struct love{
	int to,nex;
}edge[N];
void add(int u,int v){
	cnt++;
	edge[cnt].to=v;
	edge[cnt].nex=head[u];
	head[u]=cnt;
}
void dfs1(int u,int fa){
	siz[u]=1,dp[u]=a[u];
	for(int i=head[u];i!=0;i=edge[i].nex){
		int v=edge[i].to;
		if(v==fa) continue;
		dfs1(v,u);
		siz[u]+=siz[v]%mod;
		siz[u]=siz[u]%mod; 
		dp[u]=dp[u]%mod+dp[v]%mod*num[u]%mod%mod;
		dp[u]=dp[u]%mod;
		dp[u]+=a[u]%mod*siz[v]%mod%mod;
		dp[u]=dp[u]%mod;
	}
}
void dfs2(int u,int fa){
	if(u!=1){
		int t1=(f[fa]%mod-(dp[u]%mod*num[fa]%mod%mod+a[fa]%mod*siz[u]%mod%mod)%mod)%mod;
		t1=t1%mod;
		f[u]=(siz[1]-siz[u])%mod*a[u]%mod+t1%mod*num[u]%mod%mod+dp[u]%mod;
		f[u]=f[u]%mod;
	}
	for(int i=head[u];i!=0;i=edge[i].nex){
		int v=edge[i].to;
		if(v==fa) continue;
		dfs2(v,u);
	}
}
signed main(){
	scanf("%lld",&n);
	for(int i=1;i<=n;i++){
		scanf("%lld",&a[i]);
		num[i]=10;
		while(num[i]<=a[i]) num[i]*=10;
	}
	for(int i=1;i<=n-1;i++){
		int p;
		scanf("%lld",&p);
		add(p,i+1);
		add(i+1,p);
	}
	dfs1(1,0);
	f[1]=dp[1];
	dfs2(1,0);
	for(int i=1;i<=n;i++) ans=(ans%mod+f[i]%mod)%mod;
	printf("%lld",ans%mod);
	return 0;
}