#include<random>
#include<iostream>
#include<iomanip>
#include<cmath>
#include<ctime>
#include<cctype>
#include<cstdio>
#include<cstdlib>
#include<climits>
//#define NDEBUG
#include<cassert>
#include<cstring>
#include<complex>
#include<algorithm>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<bitset>
//#define LL __int128
#define LL long long
#define ULL unsigned LL
#define uint unsigned int
//#define int LL
//#define double long double
#define mkp make_pair
#define par pair<int,int>
#define psb push_back
#define epb emplace_back
#define f(x) ((x).first)
#define s(x) ((x).second)
using namespace std;
#define Lbt(x) ((x)&(-(x)))
#define Swap(x,y) (x^=y^=x^=y)
const int Mxxx=1e5;
inline char gc()
{
//	return getchar();
	static char buf[Mxxx],*p1=buf,*p2=buf;
	return p1==p2&&(p2=(p1=buf)+fread(buf,1,Mxxx,stdin),p1==p2)?EOF:*p1++;
}
inline char pc(char ch,bool fl=false)
{
//	return fl?0:putchar(ch),0;
	static char buf[Mxxx],*p1=buf,*p2=buf+Mxxx;
	return (fl||((*p1++=ch)&&p1==p2))&&(fwrite(buf,1,p1-buf,stdout),p1=buf),0;
}
#define output pc('!',true)
inline int read()
{
	char ch=gc();
	int gans=0,gflag=0;
	for(;ch<'0'||'9'<ch;gflag|=ch=='-',ch=gc());
	for(;'0'<=ch&&ch<='9';gans=(gans<<1)+(gans<<3)+(ch^48),ch=gc());
	return gflag?-gans:gans;
}
template<typename T>
inline char read(T&gans)
{
	char ch=gc();
	int gflag=0;gans=0;
	for(;ch<'0'||'9'<ch;gflag|=ch=='-',ch=gc());
	for(;'0'<=ch&&ch<='9';gans=(gans<<1)+(gans<<3)+(ch^48),ch=gc());
	return gans=gflag?-gans:gans,ch;
}
template<typename T>
inline void write(T x)
{
	if(x>9)write(x/10);
	pc(x%10^48);
}
template<typename T>
inline void writenum(T x,char ch)
{
	if(x<0)pc('-'),x=-x;
	write(x);pc(ch);
}
inline void writechar(char x,char ch)
{
	pc(x);pc(ch);
}
template<typename T>
inline T Max(T x,T y)
{
	return x>y?x:y;
}
template<typename T>
inline T Min(T x,T y)
{
	return x<y?x:y;
}
template<typename T>
inline T Abs(T x)
{
	return x<0?-x:x;
}
template<typename T>
inline void ckmx(T&x,T y)
{
	x=Max(x,y);
}
template<typename T>
inline void ckmn(T&x,T y)
{
	x=Min(x,y);
}
const int Mx=1e6;
int n,cnt,c[Mx+5],h[Mx+5],du[Mx+5],nxt[(Mx<<1)+5],tto[(Mx<<1)+5];
inline void ade(int x,int y){nxt[++cnt]=h[x];tto[h[x]=cnt]=y;du[y]++;}
inline void Ade(int x,int y){ade(x,y),ade(y,x);}
inline vector<int> Mrg(vector<int>&x,vector<int>&y)
{
	int sx=!x.empty()?x.size():0,sy=!y.empty()?y.size():0;
	int i,j;vector<int>v;v.clear();
	for(i=j=0;i<sx&&j<sy;)v.epb((x[i]<=y[j]?x[i++]:y[j++]));
	for(;i<sx;i++)v.epb(x[i]);
	for(;j<sy;j++)v.epb(y[j]);
	return v;
}
vector<int>vec[Mx+5],rcd[Mx+5];int tt[Mx+5];
inline void DFS(int x,int y)
{
	int i,j,k,t,p,v,ls,to;vector<int>tmp;tmp.clear();
	for(i=h[x];i;i=nxt[i])
	{
		if((to=tto[i])^y)
		{
			DFS(to,x);
			tmp=Mrg(tmp,vec[to]);
		}
	}
//	cout<<"Ck_tmp_before:"<<x<<" "<<(!tmp.empty()?tmp.size():0)<<":";
//	for(int vv:tmp)cout<<vv<<" ";
//	cout<<"\n";
//	for(i=1,j=0,k=!tmp.empty()?tmp.back():0;c[x]>=du[x]&&i<=k;i++)
//	{
//		for(t=0;j<(int)tmp.size()&&tmp[j]==i;j++)t++;
//		c[x]-=t+(y!=0);if(y)c[y]++;
//		tt[x]++;
//	}
	for(ls=i=0,k=!tmp.empty()?tmp.size():0;i<k&&c[x]>=du[x];i=j)
	{
		for(j=i;j<k&&tmp[j]==tmp[i];j++);
		t=j-i;t+=(y?tmp[i]-ls:0);
//		if(c[x]-t<du[x]&&(tmp[i]>ls+1)&&y&&c[x]-(tmp[i]-ls-1)<du[x])
		if(tmp[i]>ls+1&&y&&c[x]-(tmp[i]-ls-1)<du[x])
		{
			t=c[x]-du[x]+1;c[x]-=t;
			tt[x]+=t;c[y]+=t;
			break;
		}
		c[x]-=t;tt[x]+=tmp[i]-ls;
		if(y)c[y]+=tmp[i]-ls;
		ls=tmp[i];
	}
//	if(i<=k)
	if(i<k)
	{
		assert(c[x]<du[x]);
		vector<int>v;v.clear();
//		for(;j<(int)tmp.size();j++)v.epb(tmp[j]-tt[x]);
		for(;i<k;i++)v.epb(tmp[i]-tt[x]);
		swap(v,tmp);
	}
	else
	{
		tmp.clear();
		if(c[x]>=du[x])
		{
			assert(y);
			t=c[x]-du[x]+1;//tt[x]+=t;
			c[x]-=t;c[y]+=t;
		}
	}
//	cout<<"Ck_tmp_after:"<<x<<" "<<(!tmp.empty()?tmp.size():0)<<":";
//	for(int vv:tmp)cout<<vv<<" ";
//	cout<<"\n";
	for(i=1;i<=du[x]-1-c[x];i++)vec[x].epb(i);
	for(i=0,ls=0,p=du[x]-1-c[x],k=!tmp.empty()?tmp.size():0;i<k;i++)
	{
		vec[x].epb(p+(v=tmp[i])-ls+1);
		rcd[x].epb(ls=v);p=vec[x].back();
	}
//	cout<<"Ck_vec:"<<x<<" "<<(!vec[x].empty()?vec[x].size():0)<<":";
//	for(int vv:vec[x])cout<<vv<<" ";
//	cout<<"\n";
//	cout<<"Ck_Final_c:"<<x<<":"<<c[x]<<" "<<du[x]<<"|"<<tt[x]<<" "<<c[y]<<"\n";
}
inline void Slv(int x,int y)
{
	int i,j,k,t,to;int ls;
//	for(i=1,j=0,k=!rcd[x].empty()?rcd[x].back():0;c[x]>=du[x]&&i<=k;i++)
//	{
//		for(t=0;j<(int)rcd[x].size()&&rcd[x][j]==i;j++)t++;
//		c[x]-=t+(y!=0);tt[x]++;
//	}
	for(ls=i=0,k=!rcd[x].empty()?rcd[x].size():0;i<k&&c[x]>=du[x];i=j)
	{
		for(j=i;j<k&&rcd[x][j]==rcd[x][i];j++);
		t=j-i;t+=(y?rcd[x][i]-ls:0);
//		if(c[x]-t<du[x]&&(rcd[x][i]>ls+1)&&y&&c[x]-(rcd[x][i]-ls-1)<du[x])
		if(rcd[x][i]>ls+1&&y&&c[x]-(rcd[x][i]-ls-1)<du[x])
		{
			t=c[x]-du[x]+1;c[x]-=t;
			tt[x]+=t;
			break;
		}
		c[x]-=t;tt[x]+=rcd[x][i]-ls;
		ls=rcd[x][i];
	}
//	cout<<"Slv???:"<<x<<" "<<k<<":"<<c[x]<<" "<<du[x]<<"???"<<i<<"\n";
	if(c[x]>=du[x])
	{
		assert(i==k);
		t=c[x]-du[x]+1;//tt[x]+=t;
		c[x]-=t;
	}
	for(i=h[x];i;i=nxt[i])
	{
		if((to=tto[i])^y)
		{
			c[to]+=tt[x];
			Slv(to,x);
		}
	}
}
signed main()
{
	#ifndef ONLINE_JUDGE
//	freopen("_.in","r",stdin);
//	freopen("_.out","w",stdout);
	#endif
	int i,s=0;n=read();
	for(i=1;i<n;i++)Ade(read(),read());
	for(i=1;i<=n;i++)c[i]=read(),s+=du[i]-1;
	for(i=1;i<=n;i++)if((s-=c[i])<0)return writenum(-1,10),output;
	DFS(1,0);Slv(1,0);for(i=1;i<=n;i++)writenum(c[i],i==n?10:32);
	return output;
}
/*
6
1 2
2 3
2 4
1 5
4 6
1 1 0 0 1 1
*/
/*
12
1 2
1 3
2 4
3 5
5 6
2 7
7 8
4 9
8 10
5 11
3 12
2 0 0 0 1 0 1 0 1 1 0 1
*/