#pragma GCC optimize("Ofast","unroll-loops")
#pragma GCC push_options
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#include <xmmintrin.h>
#include <immintrin.h>
using namespace::std;
__attribute__((constructor))void init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// typedef mp::number<mp::cpp_dec_float<0>> cdouble;
// typedef mp::cpp_int cint;
template<typename T>using pbds=__gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T>using pbds_map=__gnu_pbds::tree<T,T,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T,typename E>using hash_map=__gnu_pbds::gp_hash_table<T,E>;
template<typename T>using pqueue =__gnu_pbds::priority_queue<T, greater<T>,__gnu_pbds::rc_binomial_heap_tag>;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define EPS (1e-10)
//#define MOD 1000000007LL
#define MOD 998244353LL
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>inline void numout(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i<INF/2?i:"INF";f=1;}cout<<endl;}
template<typename T>inline void numout2(T t){for(auto i:t)numout(i);}
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void _output(T t){bool f=0;for(lint i=0;i<t.size();i++){cout<<f?"":" "<<t[i];f=1;}cout<<endl;}
template<typename T>inline void _output2(T t){for(lint i=0;i<t.size();i++)output(t[i]);}
#define rep(i,n) for(lint i=0;i<lint(n);++i)
#define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
#define rrep(i,n) for(lint i=lint(n)-1;i>=0;--i)
#define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
#define irep(i) for(lint i=0;;++i)
#define all(n) begin(n),end(n)
#define dist(a,b,c,d) sqrt(pow(a-c,2)+pow(b-d,2))
inline lint gcd(lint A,lint B){return B?gcd(B,A%B):A;}
inline lint lcm(lint A,lint B){return A/gcd(A,B)*B;}
// inline cint cgcd(cint A,cint B){return B?cgcd(B,A%B):A;}
// inline cint clcm(cint A,cint B){return A/cgcd(A,B)*B;}
inline bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
inline bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
auto call=[&](auto f,auto... args){return f(f,args...);};

auto tree_dp(const auto& g,const auto& f,const auto& res_e,int now=0,int par=-1){
    auto res=res_e;
    for(auto e:g[now]){
        res=f(res,tree_dp(g,f,res_e,e,now));
    }
    return res;
}
vec ans;
vector<pair<lint,lint>>memo;
pair<lint,lint> fn(const auto& g,int now=0,int par=-1){
    lint l=-INF,r=INF;
    if(ans[now]!=-1){
        l=ans[now];
        r=ans[now];
    }
    for(auto e:g[now]){
        if(e==par)continue;
        auto d=fn(g,e,now);
        if(d==make_pair(-INF,INF))continue;
        if(l==-INF&&r==INF){
            l=d.first-1;
            r=d.second+1;
        }else{
            if(l%2==d.first%2){
                cout<<"No"<<endl;
                exit(0);
            }else{
                chmax(l,d.first-1);
                chmin(r,d.second+1);
                if(l>r){
                    cout<<"No"<<endl;
                    exit(0);
                }
            }
        }
    }
    return memo[now]=make_pair(l,r);
}
void gn(const auto& g,int now=0,int par=-1,lint par_p=INF){
    if(par_p==INF){
        ans[now]=memo[now].first;
    }else{
        if(memo[now].first<=par_p-1&&par_p-1<=memo[now].second){
            ans[now]=par_p-1;
        }else{
            ans[now]=par_p+1;
        }
    }
    for(auto e:g[now]){
        if(e==par)continue;
        gn(g,e,now,ans[now]);
    }
}
int main(){
    lint n;
    cin>>n;
    mat v(n);
    rep(i,n-1){
        lint s,t;
        cin>>s>>t;
        s--;t--;
        v[s].push_back(t);
        v[t].push_back(s);
    }
    memo.resize(n);
    ans.resize(n,-1);
    lint q;
    cin>>q;
    rep(i,q){
        lint s,t;
        cin>>s>>t;
        s--;
        ans[s]=t;
    }
    fn(v);gn(v);
    cout<<"Yes"<<endl;
    rep(i,n){
        cout<<ans[i]<<endl;
    }
}

Measured memory_bytes: 19712