#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
 
#include<bits/stdc++.h>
using namespace std;

const int MOD=998244353;
const ll c2=499122177;

const int MAX=200200;
vector<int> G[MAX];
ll dp[MAX],ans[MAX],A[MAX];

void dfs1(int v,int p){
  dp[v]=1;
  for(auto nv:G[v]){
    if(nv==p) continue;
    dfs1(nv,v);
    dp[v]+=dp[nv];
  }
}

void dfs2(int v,int p){
  ll ls=0,ls2=0,rs=0,rs2=0;
  for(auto nv:G[v]){
    if(A[nv]<A[v]){
      ls=(ls+dp[nv])%MOD;
      ls2=(ls2+dp[nv]*dp[nv]%MOD)%MOD;
    }
    else if(A[nv]>A[v]){
      rs=(rs+dp[nv])%MOD;
      rs2=(rs2+dp[nv]*dp[nv]%MOD)%MOD;
    }
    ans[v]=((ls*ls%MOD-ls2+MOD)%MOD*c2%MOD+(rs*rs%MOD-rs2+MOD)%MOD*c2%MOD)%MOD;
  }
  
  int N=G[v].size();
  vector<ll> L(N),R(N);
  rep(i,N) L[i]=R[i]=dp[G[v][i]];
  for(int i=1;i<N;i++) L[i]=(L[i]+L[i-1])%MOD;
  for(int i=N-2;i>=0;i--) R[i]=(R[i]+R[i+1])%MOD;
  
  rep(i,N){
    if(G[v][i]==p) continue;
    dp[v]=1;
    if(i) dp[v]=(dp[v]+L[i-1])%MOD;
    if(i<N-1) dp[v]=(dp[v]+R[i+1])%MOD;
    dfs2(G[v][i],v);
  }
}
 
int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  int n;
  cin>>n;
  rep(i,n-1){
    int u,v;
    cin>>u>>v;
    u--,v--;
    G[u].push_back(v);
    G[v].push_back(u);
  }
  rep(i,n) cin>>A[i];
  
  dfs1(0,-1);
  dfs2(0,-1);
  
  ll sum=0;
  rep(i,n) sum=(sum+ans[i])%MOD;
  cout<<sum<<endl;
  
  return 0;
}