#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

#define rep(i,n) for(ll i=0;i<n;++i)
#define all(a) (a).begin(),(a).end()
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
template<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }
template<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }
template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &a){
    if (a.empty()) return os;
    os << a.front();
    for (auto e : a | views::drop(1)){
        os << ' ' << e;
    }
    return os;
}

void dump(auto ...vs){
    ((cout << vs << ' '), ...) << endl;
}

#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;

void solve() {
    ll N;
    cin>>N;
    vector<ll> A(N);
    ll sa=0;
    rep(i,N){
        cin>>A[i];
        sa+=A[i];
    }
    vector<vector<pair<ll,ll>>> child(N);
    vector<pair<ll,ll>> parent(N);
    vector<ll> B(N);
    rep(i,N-1){
        cin>>B[i+1];
        B[i+1]--;
    }
    vector<ll> C(N);
    rep(i,N-1){
        cin>>C[i+1];
        C[i+1]--;
    }
    vector<ll> P(N);
    rep(i,N-1){
        cin>>P[i+1];
        P[i+1]--;
    }
    for (ll i=1;i<N;i++){
        parent[i]={B[i],P[i]};
        child[P[i]].emplace_back(C[i],i);
    }
    vector<ll> S(N);
    auto dfs=[&](auto self,ll cp)->ll {
        ll v=A[cp];
        for (auto [_,np]:child[cp]){
            v+=self(self,np);
        }
        S[cp]=v;
        return v;
    };
    dfs(dfs,0);
    mint ans=0;
    for (ll cp=1;cp<N;cp++){
        mint v=S[cp];
        ans+=v*(sa-v);
    }
    rep(cp,N){
        vector<pair<ll,mint>> C;
        for (auto [a,np]:child[cp]){
            C.emplace_back(a,S[np]);
        }
        if (cp!=0){
            C.emplace_back(parent[cp].first,sa-S[cp]);
        }
        sort(all(C),[](pair<ll,mint> a,pair<ll,mint> b){
            return (a.first<b.first);
        });
        C.emplace_back(A[cp]-1,0);
        ll cs=C.size();
        mint rs=0;
        for (auto [_,v]:C){
            rs+=v;
        }
        // dump(rs.val());
        mint ls=0;
        ll nowa=1;
        for (auto [b,v]:C){
            mint right=rs+A[cp];
            mint left=ls;
            mint t=0;
            t+=(mint)(b-nowa+1)*left*right;
            t+=(mint)(right-left)*(b-nowa+1)*(nowa+b)/2;
            t-=(mint)(b+1)*b*(2*b+1)/6;
            t+=(mint)(nowa-1)*nowa*(2*nowa-1)/6;
            // dump(cp,b,left.val(),right.val(),t.val());
            ans+=t;
            ls+=v;
            rs-=v;
            nowa=b+1;
        }
    }
    ans*=2;
    cout<<ans.val()<<'\n';
    return;
}


int main() {
    cin.tie(0)->sync_with_stdio(0);
    ll T=1;
    while (T--){
        solve();
    }
    return 0;
}