#include<bits/stdc++.h>
#define int long long
#define db double
#define pb push_back
#define pii pair<int, int>
#define ll long long
using namespace std;

void solve() {
    int n;
    cin>>n;
    vector<int> a[n + 1];
    vector<int> c(n + 1);
    vector<int> deg(n + 1);
    set<pii> q;
    for (int i = 1; i <= n-1; i++)
    {
        int u,v;
        cin>>u>>v;
        a[u].pb(v);
        a[v].pb(u);
    }
    int sum = 0;
    for(int i=1;i<=n;i++){
        cin >> c[i];
        sum += c[i];
        deg[i] = a[i].size();
        if(c[i]>=deg[i])
            q.insert({-deg[i],i});
    }
    if(sum>n-2&&n!=1){
        cout << -1<<'\n';
        return;
    }
    if(n==1){
        cout << c[1];
        return;
    }
    while(!q.empty()){
        auto [d,u]=*q.begin();
        q.erase(q.begin());
        int k=c[u]/deg[u];
        c[u]=c[u]%deg[u];
        for(auto p:a[u]){
            c[p]+=k;
            if(c[p]>=deg[p])
                q.insert({-deg[p], p});
        }
    }
    for (int i = 1;i<=n-1;i++){
        cout << c[i] << " ";
	}
	cout<<c[n];
}
signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    while (t--)
        solve();
    return 0;
}