#include <atcoder/modint.hpp>
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto &&e : v)
#define all(a) begin(a), end(a)
#define sz(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S> bool chmin(T &a, const S &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S> bool chmax(T &a, const S &b) {
  return a < b ? a = b, 1 : 0;
}
const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;
#define i128 __int128_t
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

using mint = atcoder::modint998244353;

int main() {
  int N;
  cin >> N;
  vl A(N);
  for (ll &i : A)
    cin >> i;
  vector<vi> G(N);
  vi B(N), C(N), P(N, -1);
  rep(i, 1, N) cin >> B[i];
  rep(i, 1, N) cin >> C[i];
  rep(i, 1, N) cin >> P[i], --P[i];
  vector<mint> subtree(N);
  rep(i, N) { subtree[i] = A[i]; }
  per(i, N, 1) { subtree[P[i]] += subtree[i]; }

  vector<vector<pii>> edge(N);
  rep(i, 1, N) {
    edge[P[i]].push_back(pii{C[i], i});
    edge[i].push_back(pii{B[i], P[i]});
  }

  mint div6 = mint(1) / 6;
  mint ans = 0, allsum = subtree[0];

  // k in [l,r)
  auto calc = [&](mint l, mint r) -> mint {
    mint ml = l, mr = r;
    return (ml - mr) *
           (2 * mr * mr + mr * (2 * ml - 3 * (allsum + 1)) +
            (ml - 1) * (2 * ml - 3 * allsum - 1)) *
           div6;
  };
  rep(i, N) {
    sort(all(edge[i]));
    for (auto [x, v] : edge[i]) {
      if (v == P[i])
        continue;
      ans += (allsum - subtree[v]) * subtree[v];
    }
    int l = 1;
    mint s = 0;
    for (auto [x, v] : edge[i]) {
      ans += calc(l + s, x + s);
      l = x;
      if (v == P[i])
        s += allsum - subtree[i];
      else
        s += subtree[v];
    }
    ans += calc(l + s, A[i] + s);
  }
  cout << (ans*2).val() << '\n';
}