#include<bits/stdc++.h>
using namespace std;
int n;
vector<int>g[1001001];
int a[1001001];
set<int>s;
int fa[1001001];
int tot,dfn[1001001],sz[1001001],idfn[1001001];
void dfs(int x,int pa){
    dfn[x]=++tot,sz[x]=1;
    idfn[tot]=x;fa[x]=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 dfs2(int x,int pa){
    for (auto y:g[x])if(y!=pa)dfs2(y,x);
    while(a[x]>=g[x].size()){
        a[x]--;a[fa[x]]++;
        int now=dfn[x]+1;
        // cout<<a[x]<<" "<<g[x].size()<<"@@@@@@\n";
        while(now<dfn[x]+sz[x]){
            
            auto it=s.lower_bound(now);
            // cout<<x<<"!!!!!!"<<now<<"\n";
            if(it==s.end())break;
            if((*it)>=dfn[x]+sz[x])break;
            int itt=idfn[*it];
            // cout<<now<<" "<<itt<<" "<<fa[itt]<<"@@!!!\n";
            del(itt);del(fa[itt]);
            a[itt]++,a[fa[itt]]--;
            ins(itt);ins(fa[itt]);
            now=dfn[itt]+sz[itt];
        }
    }
  
    // 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);dfs2(1,1);
    for (int i=1;i<n;i++)
        cout<<a[i]<<" ";
    cout<<a[n]<<"\n";
}