#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VI a(n), b(n), c(n), p(n);
  rep(i, n) cin >> a[i];
  rep(i, n) if (i) cin >> b[i], b[i]--;
  rep(i, n) if (i) cin >> c[i], c[i]--;
  rep(i, n) if (i) cin >> p[i], p[i]--;
  ll tot = accumulate(all(a), 0LL);
  vector<vector<pair<int, ll>>> ch(n);
  mint ans;
  mint inv6 = mint(6).inv();
  rrep(i, n) {
    ll rest = tot - a[i];
    for (auto [j, cnt] : ch[i]) rest -= cnt;
    if (i) {
      ans += mint(tot - rest) * rest;
      ch[i].emplace_back(b[i], rest);
      ch[p[i]].emplace_back(c[i], tot - rest);
    }
    ch[i].emplace_back(0, 0);
    ch[i].emplace_back(a[i]-1, 0);
    ranges::sort(ch[i], {}, &pair<int, ll>::first);
    mint A;
    mint T = tot;
    rep(idx, ssize(ch[i]) - 1) {
      A += ch[i][idx].second;
      mint l = ch[i][idx].first, r = ch[i][idx+1].first;
      ans += inv6 * (l-r) * (6*A*A+6*A*(l+r-T+1)+2*l*l+l*(2*r-3*T+3)+(r+1)*(2*r-3*T+1));
    }
  }
  ans *= 2;
  cout << ans.val() << '\n';
}