//header
#ifdef LOCAL
    #include "cxx-prettyprint-master/prettyprint.hpp"
    #define print(x) cout << x << endl
#else
    #define print(...) 42
#endif
    #pragma GCC optimize("Ofast")
    #include <bits/stdc++.h>
    //types
    using namespace std;
    using ll = long long;
    typedef pair < ll , ll >Pl;
    typedef pair < int, int >Pi;
    typedef vector<ll> vl;
    typedef vector<int> vi;
    template< typename T >
    using mat = vector< vector< T > >;
    template <std::uint_fast64_t Modulus> class modint {
        using u64 = std::uint_fast64_t;

        public:
        u64 a;

        constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
        constexpr u64 &value() noexcept { return a; }
        constexpr const u64 &value() const noexcept { return a; }
        constexpr modint operator+(const modint rhs) const noexcept {
            return modint(*this) += rhs;
        }
        constexpr modint operator-(const modint rhs) const noexcept {
            return modint(*this) -= rhs;
        }
        constexpr modint operator*(const modint rhs) const noexcept {
            return modint(*this) *= rhs;
        }
        constexpr modint operator/(const modint rhs) const noexcept {
            return modint(*this) /= rhs;
        }
        constexpr modint &operator+=(const modint rhs) noexcept {
            a += rhs.a;
            if (a >= Modulus) {
            a -= Modulus;
            }
            return *this;
        }
        constexpr modint &operator-=(const modint rhs) noexcept {
            if (a < rhs.a) {
            a += Modulus;
            }
            a -= rhs.a;
            return *this;
        }
        constexpr modint &operator*=(const modint rhs) noexcept {
            a = a * rhs.a % Modulus;
            return *this;
        }
        constexpr modint &operator/=(modint rhs) noexcept {
            u64 exp = Modulus - 2;
            while (exp) {
            if (exp % 2) {
                *this *= rhs;
            }
            rhs *= rhs;
            exp /= 2;
            }
            return *this;
        }
        };
    //abbreviations
    #define all(x) (x).begin(), (x).end()
    #define rall(x) (x).rbegin(), (x).rend()
    #define rep2(i,a,b) for(int i=(a);i<(b);++i)
    #define rep(i,n) for(int i=0;i<(n);++i)
    #define rev(i,n) for(int i=n-1;i>=0;i--)
    #define SZ(x) ((ll)(x).size())
    #define pb(x) push_back(x)
    #define ff first
    #define ss second
    #define mp make_pair
    //functions
    ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
    template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
    template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
    template< typename T >
    T mypow(T x, ll n) {
        T ret = 1;
        while(n > 0) {
            if(n & 1) (ret *= x);
            (x *= x);
            n >>= 1;
        }
        return ret;
    }
    uint64_t my_rand(void) {
        static uint64_t x = 88172645463325252ULL;
        x = x ^ (x << 13); x = x ^ (x >> 7);
        return x = x ^ (x << 17);
    }
    //graph template
    template< typename T >
    struct edge {
        int src, to;
        T cost;

        edge(int to, T cost) : src(-1), to(to), cost(cost) {}

        edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

        edge &operator=(const int &x) {
        to = x;
        return *this;
    }

    operator int() const { return to; }
    };

    template< typename T >
    using Edges = vector< edge< T > >;
    template< typename T >
    using WeightedGraph = vector< Edges< T > >;
    using UnWeightedGraph = vector< vector< int > >;

//constant
#define INF 1'010'000'000'000'000'017LL
#define mod 1000000007LL
typedef modint<mod> mint;
#define eps 0.000001
const double PI = M_PI;
//library
mat<ll> g;
vl value(pow(10, 5), -1);
vector<Pl> range;
Pl dfs(int v, int p, Pl lr){
    ll l = lr.first, r = lr.second;
    if(value[v]>=0){
        l = value[v]; r = value[v]+1;
    }
    for(auto nv:g[v]){
        if(nv == p)continue;
        lr = dfs(nv, v, mp(l-1, r+1));
        chmax(l, lr.first);chmin(r, lr.second);
    }
    range[v] = mp(l, r);
    return mp(l-1, r+1);
}   
//main
int main(){
    int n; cin>>n;
    g.resize(n);
    range.resize(n);
    rep(i, n-1){
        int a, b; cin>>a>>b;
        g[a-1].pb(b-1); g[b-1].pb(a-1);
    }
    int k; cin>>k;
    int v0 = -1;
    rep(i, k){
        ll v, p; cin>>v>>p;
        value[v-1] = p;
        v0 = v-1;
    }
    dfs(v0, -1, mp(value[v0-1], value[v0-1]+1));
    vi que = {v0};
    vl ans(n, -1);
    ans[v0] = value[v0];
    while(que.size()){
        int v = que.back();
        que.pop_back();
        ll a = ans[v];
        for(auto nv:g[v]){
            if(ans[nv]>=0)continue;
            ll l = range[nv].first, r = range[nv].second;
            if(l<=a+1&&a+1<r)ans[nv] = a+1;
            else if(l<=a-1&&a-1<r)ans[nv] = a-1;
            else{
                cout << "No" << endl;
                return 0;
            }
            que.pb(nv);
        }
    }
    cout << "Yes" << endl;
    rep(i, n){
        cout << ans[i] << endl;
    }
}   


Measured memory_bytes: 14336