//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int n;
ll k;
vector<int> G[100100];
int siz[100100];
ll a[100100];
void dfs(int u,int fa)
{
	siz[u]=1;
	for(auto v:G[u])
		if(v!=fa)
		{
			dfs(v,u);
			siz[u]+=siz[v];
		}
}
ll lim[100100];
ll lim2[100100];
void dfs2(int u,int fa)
{
	for(auto v:G[u])
		if(v!=fa)
			dfs2(v,u);
	vector<int> vec;
	for(auto v:G[u])
		if(v!=fa)
			vec.pb(v);
	sort(ALL(vec),[&](int a,int b){return lim[a]+siz[a]*2<lim[b]+siz[b]*2;});
	ll sum=0;
	for(auto a:vec)
	{
		lim[u]=min(lim[u],lim[a]-sum-1);
		sum+=siz[a]*2;
	}
}
void dfs3(int u,int fa)
{
	for(auto v:G[u])
		if(v!=fa)
			dfs3(v,u);
	vector<int> vec;
	for(auto v:G[u])
		if(v!=fa)
			vec.pb(v);
	if(!sz(vec))
		return ;
	sort(ALL(vec),[&](int a,int b){return lim[a]+siz[a]*2<lim[b]+siz[b]*2;});
	vector<ll> v2;
	ll sum=0;
	for(auto a:vec)
	{
		v2.pb(lim[a]-sum-1);
		sum+=siz[a]*2;
	}
	vector<ll> pre(sz(v2)+1),suf(sz(v2)+1);
	pre[0]=suf.back()=1ll*inf*inf;
	for(int i=0;i<sz(v2);i++)
		pre[i+1]=min(pre[i],v2[i]);
	for(int i=sz(v2)-1;i>=0;i--)
		suf[i]=min(suf[i+1],v2[i]);
	ll mx=-1ll*inf*inf;
	for(int i=0;i<sz(vec);i++)
	{
		int v=vec[i];
		ll val=min({lim2[u],lim2[v]-(sum-siz[v]*2)-1,pre[i],suf[i+1]+siz[v]*2,a[u]+k-2-(sum-siz[v]*2)});
		mx=max(mx,val);
	}
	lim2[u]=mx;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>k;
	for(int i=1;i<n;i++)
	{
		int u,v;
		cin>>u>>v;
		G[u].pb(v);
		G[v].pb(u);
	}
	for(int i=1;i<=n;i++)
		cin>>a[i];
	dfs(1,0);
	for(int i=1;i<=n;i++)
	{
		lim[i]=a[i];
		if(i==1) lim[i]=1ll*inf*inf;
		lim2[i]=lim[i];
		if(i>1) lim[i]=min(lim[i],a[i]+k-2-2*(siz[i]-1));
		else lim[i]=min(lim[i],a[i]+k-2*(siz[i]-1));
	}
	dfs2(1,0);
	dfs3(1,0);
	cout<<max(-1ll,lim2[1])<<endl;
	return 0;
}