#include <atcoder/all>
#include <bits/stdc++.h>

using namespace std;
using namespace atcoder;

#ifdef DEBUG
#include "debug/all.hpp"
#else
#define debug(...) 42
#endif

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<ll, ll>;
using tp = tuple<ll, ll, ll>;

template <class T>
using vec = vector<T>;
template <class T>
using vvec = vector<vec<T>>;

#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
#define rep(i, m, n) for(ll i = (ll)(m); i < (ll)(n); ++i)
#define rep2(i, m, n) for(ll i = (ll)(n)-1; i >= (ll)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)

constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 30;
// constexpr long long MOD = (ll)1e9 + 7;
constexpr long long MOD = 998244353LL;
static const ld pi = 3.141592653589793L;

template <class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

template <class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

struct Edge {
    int to, rev;
    ll cap;
    Edge(int _to, int _rev, ll _cap) : to(_to), rev(_rev), cap(_cap) {}
};

typedef vector<Edge> Edges;
typedef vector<Edges> Graph;

void add_edge(Graph &G, int from, int to, ll cap, bool revFlag, ll revCap) {
    G[from].push_back(Edge(to, (int)G[to].size(), cap));
    if(revFlag)
        G[to].push_back(Edge(from, (int)G[from].size() - 1, revCap));
}

void solve() {
    int n;
    cin >> n;
    Graph g(n);
    REP(i, n - 1) {
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        add_edge(g, u, v, 1, true, 1);
    }
    vec<ll> a(n);
    REP(i, n) { cin >> a[i]; }

    using mint = modint998244353;
    mint ans = 0;

    auto calc = [&](vec<ll> &vs) -> mint {
        mint ret = 0;
        mint sum = 0;
        for(auto v : vs) {
            ret += sum * v;
            sum += v;
        }
        return ret;
    };

    auto dfs = [&](auto &&self, int v, int p) -> ll {
        ll sum = 1;
        vec<ll> big, small;
        for(auto e : g[v]) {
            if(e.to == p)
                continue;
            ll nxt = self(self, e.to, v);
            if(a[v] < a[e.to])
                big.push_back(nxt);
            else if(a[v] > a[e.to])
                small.push_back(nxt);
            sum += nxt;
        }
        if(p != -1) {
            if(a[v] < a[p]) {
                big.push_back(n - sum);
            } else if(a[v] > a[p]) {
                small.push_back(n - sum);
            }
        }
        ans += calc(big);
        ans += calc(small);
        return sum;
    };
    dfs(dfs, 0, -1);

    cout << ans.val() << en;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    // cout << fixed << setprecision(10);

    // ll t;
    // cin >> t;
    // REP(i, t - 1) {
    //     solve();
    // }

    solve();

    return 0;
}