#include <bits/stdc++.h>
using namespace std;
#define _rep(i_,a_,b_) for(int i_ = (a_); i_ <= (b_); ++i_)
#define mid ((L+R) >> 1)
#define multiCase() int testCnt = in(); _rep(curCase,1,testCnt)
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
using ll = long long;
using pii = pair<int,int>;

int in(void) { int x; scanf("%d", &x); return x; } ll inl(void) { ll x; scanf("%lld", &x); return x; }
void out(int x) { printf("%d ", x); } void outln(int x) { printf("%d\n", x); }
void out(ll x) { printf("%lld ", x); } void outln(ll x) { printf("%lld\n", x); }
template<typename T> void chkmax(T &a, const T &b) { a = max(a, b); } 
template<typename T> void chkmin(T &a, const T &b) { a = min(a, b); } 
const int kN = 150050;
int n, a[kN]; vector<int> g[kN];
struct Info {
	ll F, sum; int cnt;
	Info operator + (const Info &rhs) const {
		Info res;
		res.F = F + sum * rhs.cnt + rhs.F;
		res.sum = sum + rhs.sum;
		res.cnt = cnt + rhs.cnt;
		return res;
	}
	Info(int val = 0) : F(val), sum(val), cnt(1) {}
};
//bl[0] : 自底向上， bl[1]：自顶向下
Info bl[2][20][kN]; int fa[20][kN], dep[kN];
void dfs(int u, int f) {
	dep[u] = dep[f] + 1; fa[0][u] = f; bl[0][0][u] = bl[1][0][u] = Info(a[u]);
	_rep(i,1,19) {
		fa[i][u] = fa[i - 1][fa[i - 1][u]];
		bl[0][i][u] = bl[0][i - 1][u] + bl[0][i - 1][fa[i - 1][u]];
		bl[1][i][u] = bl[1][i - 1][fa[i - 1][u]] + bl[1][i - 1][u];
	}
	for(auto &v : g[u]) if(v != f) dfs(v, u);
}
Info query(int u, int v) {
	Info res1, res2; res1.cnt = res2.cnt = 0;
	while(u != v) {
		if(dep[u] > dep[v]) {
			int k = __lg(dep[u] - dep[v]);
			res1 = res1 + bl[0][k][u], u = fa[k][u];
		} else {
			int k = __lg(dep[v] - dep[u]);
			res2 = bl[1][k][v] + res2, v = fa[k][v];
		}
	}
	if(u == v) return res1 + Info(a[u]) + res2;
	for(int i = 19; ~i; --i) if(fa[i][v] != fa[i][u]) {
		res1 = res1 + bl[0][i][u], u = fa[i][u];
		res2 = bl[1][i][v] + res2, v = fa[i][v];
	}
	return res1 + Info(a[u]) + Info(a[fa[0][u]]) + Info(a[v]) + res2;
}
int vis[kN], siz[kN], dfn[kN], dfs_clock, inv[kN]; 
vector<int> g2[kN]; 
int rt, rtsiz;
void getsize(int u, int f, int tot) {
	siz[u] = 1; int w = 0;
	for(auto &v : g[u]) if(v != f && !vis[v]) {
		getsize(v, u, tot);
		siz[u] += siz[v]; chkmax(w, siz[v]);
	} chkmax(w, tot - siz[u]);
	if(w < rtsiz) rt = u, rtsiz = w;
}
int find(int u) {
	getsize(u, 0, 0);
	rtsiz = 1e9;
	getsize(u, 0, siz[u]);
	return rt;
}
void build(int u) {
	vis[u] = 1;
	for(auto &v : g[u]) if(!vis[v]) {
		int r = find(v);
		g2[u].emplace_back(r);
		debug("%d - %d\n", u, r);
		build(r);
	}
}
void dfs(int u) {
	dfn[u] = ++dfs_clock, inv[dfs_clock] = u, siz[u] = 1;
	for(auto &v : g2[u]) dfs(v), siz[u] += siz[v];
}
struct Line {
	ll k, b;
	ll get(ll x) { return k * x + b; }
} l[kN]; int ch[kN][2], id[kN], nc;
void insert(int &x, int L, int R, int tid) {
	if(!x) { x = ++nc, id[x] = tid; ch[x][0] = ch[x][1] = 0; return; } 
	if(l[id[x]].get(mid) < l[tid].get(mid)) swap(id[x], tid);
	if(L < R) {
		if(l[tid].k > l[id[x]].k) insert(ch[x][1], mid + 1, R, tid);
		if(l[tid].k < l[id[x]].k) insert(ch[x][0], L, mid, tid);
	}
}
ll query(int x, int L, int R, int p) {
	if(!x) return 0;
	if(L == R) return l[id[x]].get(p);
	ll ans = l[id[x]].get(p);
	chkmax(ans, p <= mid ? query(ch[x][0], L, mid, p) : query(ch[x][1], mid + 1, R, p));
	return ans;
}
vector<Info> Q[kN];
int main() { 
	n = in();
	_rep(i,2,n) {
		int u = in(), v = in();
		g[u].emplace_back(v), g[v].emplace_back(u);
	}
	_rep(i,1,n) a[i] = in();
	int rt;
	dfs(1, 0);
	build(rt = find(1)), dfs(rt);
	ll ans = 0;
	// _rep(i,1,n) debug("%d%c", dfn[i], " \n"[i == n]);
	_rep(i,1,n) {
		// debug("Solve for root %d\n", i);
		for(auto &c : g2[i]) _rep(j,dfn[c],dfn[c] + siz[c] - 1) if(dfn[c] - 1 >= dfn[i]) Q[dfn[c] - 1].emplace_back(query(i, inv[j]));
		Q[dfn[i] + siz[i] - 1].emplace_back(Info(a[i]));
		int rt = 0; nc = 0;
		_rep(j,dfn[i],dfn[i] + siz[i] - 1) {
			Info tmp = query(inv[j], i); l[j] = Line{tmp.sum, tmp.F};
			// debug("Add1 %d(%lld, %lld, %lld)\n", inv[j], tmp.cnt, tmp.sum, tmp.F);
			insert(rt, 0, n, j);
			for(auto &x : Q[j]) 
				chkmax(ans, query(rt, 0, n, x.cnt - 1) + x.F - 1ll * a[i] * x.cnt);
				// debug("For query(%lld, %lld, %lld), ans become %lld\n", x.cnt, x.sum, x.F, ans);
		}
		_rep(j,dfn[i],dfn[i] + siz[i] - 1) Q[j].clear();
		for(auto &c : g2[i]) _rep(j,dfn[c],dfn[c] + siz[c] - 1) if(dfn[c] + siz[c] < dfn[i] + siz[i]) Q[dfn[c] + siz[c]].emplace_back(query(i, inv[j]));
		rt = 0; nc = 0;
		for(int j = dfn[i] + siz[i] - 1; j >= dfn[i]; --j) {
			Info tmp = query(inv[j], i); l[j] = Line{tmp.sum, tmp.F};
			// debug("Add2 %d(%lld, %lld, %lld)\n", inv[j], tmp.cnt, tmp.sum, tmp.F);
			insert(rt, 0, n, j);
			for(auto &x : Q[j]) 
				chkmax(ans, query(rt, 0, n, x.cnt - 1) + x.F - 1ll * a[i] * x.cnt);
				// debug("For query(%lld, %lld, %lld), ans become %lld\n", x.cnt, x.sum, x.F, ans);
		}
		_rep(j,dfn[i],dfn[i] + siz[i] - 1) Q[j].clear();
	}
	outln(ans);
	return 0;
}

/* 
a list of keywords
clear empty push_back pop_back push pop top front back
emplace_back emplace push_front pop_front insert erase
find count set reset bitset map vector string multiset
first second iterator prev next deque multimap reverse
sort begin end list modify query init check calc prime
putchar getchar puts scanf printf max min swap replace
make_pair make_tuple numeric_limits auto function null
*/