#include<bits/stdc++.h>
using namespace std;
int n;
vector<int>g[1001001];
priority_queue<pair<int,int> >q;
int a[1001001];
int main(){
    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;
    for (int i=1;i<=n;i++)
    q.push({a[i],i});
    while(q.size()){
        int x=q.top().second,xx=q.top().first;
        q.pop();if(xx!=a[x]||xx<g[x].size())continue;
        int t=g[x].size();
        for (auto y:g[x])a[y]+=a[x]/t,q.push({a[y],y});
        a[x]%=t;
    }
    for (int i=1;i<=n;i++)
    cout<<a[i]<<" ";cout<<"\n";
}