#include<bits/stdc++.h>
using namespace std;
int n;
vector<int>g[1001001];
int a[1001001],dep[1001001];
set<int>s;
int tot,dfn[1001001],sz[1001001],idfn[1001001];
int st[1001001][21];
int lowbit(int x){return x&(-x);}
void dfs(int x,int pa){
    dfn[x]=++tot,sz[x]=1;
    idfn[tot]=x;dep[x]=dep[pa]+1;
    st[x][0]=pa;
    for (auto y:g[x])if(y!=pa){
        dfs(y,x);sz[x]+=sz[y];
    }
}
void del(int x){
    if(a[x]<(int)g[x].size()-1)
    s.erase(dfn[x]);
}
void ins(int x){
    if(a[x]<(int)g[x].size()-1)
    s.insert(dfn[x]);
}
void init(){
    for (int i=1;i<=20;i++)
    for (int j=1;j<=n;j++)
    st[j][i]=st[st[j][i-1]][i-1];
}
int _lca(int x,int y){
    if(dep[x]<dep[y])swap(x,y);
    int t=dep[x]-dep[y];
    for (;t;t-=lowbit(t))x=st[x][__lg(t)];
    if(x==y)return x;
    for (int i=20;~i;i--)
    if(st[x][i]!=st[y][i])x=st[x][i],y=st[y][i];
    return st[x][0];
}
int find(int x,int k){
    for (;k;k-=lowbit(k))x=st[x][__lg(k)];
    return x;
}
void dfs2(int x,int pa){
    for (auto y:g[x])if(y!=pa)dfs2(y,x);
    while(a[x]>=g[x].size()){
        // cout<<a[x]<<"!!!!"<<x<<"\n";
        // a[x]--;a[fa[x]]++;
        int now=dfn[x]+1,pre=x,mn=a[x]-g[x].size()+1;
        vector<int>v;
        while(now<dfn[x]+sz[x]){
            
            auto it=s.lower_bound(now);
            if(it==s.end())break;
            if((*it)>=dfn[x]+sz[x])break;
            int itt=idfn[*it];
            if(pre==x)mn=dep[itt]-dep[pre];
            else mn=min(mn,min(dep[pre],dep[itt])-dep[_lca(pre,itt)]);
            // cout<<pre<<"######################"<<itt<<"\n";
            v.push_back(itt);
            
            now=dfn[itt]+sz[itt];pre=itt;
        }
        // cout<<mn<<"#######\n";if(mn==1e9)exit(0);
        a[x]-=mn,a[st[x][0]]+=mn;
        for (auto itt:v){
            int fa=find(itt,mn);
            del(itt);del(fa);
            a[itt]++,a[fa]--;
            ins(itt);ins(fa);
        }
    }
  
    // cout<<x<<"@@@@@@\n";
    // for (int i=1;i<=n;i++)cout<<a[i]<<" ";cout<<"\n";
    // for (int i=1;i<=n;i++)cout<<g[i].size()<<" ";cout<<"\n";
    // for (auto i:s)cout<<idfn[i]<<" ";cout<<"\n";  
    ins(x);
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin>>n;
    for (int i=1,x,y;i<n;i++)
    cin>>x>>y,g[x].push_back(y),g[y].push_back(x);
    long long sum=0;
    for (int i=1;i<=n;i++)
    cin>>a[i],sum+=(int)g[i].size()-1-a[i];
    if(sum<0)return cout<<-1<<"\n",0;
    dfs(1,1);init();dfs2(1,1);
    for (int i=1;i<n;i++)
        cout<<a[i]<<" ";
    cout<<a[n]<<"\n";
}