#include <iostream>
#include <iomanip>
#include <fstream>
#include <string>
#include <array>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <queue>
#include <bitset>
#include <tuple>
#include <cmath>
#include <complex>
#include <algorithm>
#include <utility>
#include <regex>
#include <cstdint>
#include <numeric>
#include <functional>
#include <cassert>

using namespace std;
using ll = long long;
using ull = unsigned long long;

constexpr ll INF = 1'000'000'000;
namespace utils{
#define ALL(x) begin(x), end(x)
#define rALL(x) rbegin(x), rend(x)
    template<class T, class Compare> using p_queue = priority_queue<T, vector<T>, Compare>;
    template<class T> using min_queue = p_queue<T, greater<T>>;
    template<class T> using max_queue = p_queue<T, less<T>>;

    template<class T> bool min_update(T& X, const T& A){ if(X > A) {X = A; return true;} return false; }
    template<class T> bool max_update(T& X, const T& A){ if(X < A) {X = A; return true;} return false; }
    using V_Set = unordered_set<int>;
    using E_Set = unordered_map<int, V_Set>;

    ll operator"" _64(unsigned long long x){ return ll(x); }
    ull operator"" _64u(unsigned long long x){ return ull(x); }

    template<class T>
    vector<T> make_vector(int n, T t){
        return vector<T>(n, t);
    }
    template<class ...Ts>
    auto make_vector(int n, Ts ... ts){
        return vector<decltype(make_vector(ts...))>(n, make_vector(ts...));
    }

    template<class T>
    ostream& operator<<(ostream& os, const vector<T>& v){
        for (auto &&x : v) { os << x << ' '; } cout << endl; return os ;
    }
}
using namespace utils;

class solver{
    istream& is;
    ostream& os;
    E_Set E;
    vector<ll> vL, vR;
    vector<bool> odd;

public:
    solver(istream& I, ostream& O) :is(I), os(O) {}

    bool odd_even(int v, int p = -1, bool t = false){
        if(vL[v] != -INF){
            odd[v] = vL[v] % 2 ;
            if(p != -1 and (t != odd[v])){
                return false;
            }
            t = odd[v];
        }
        else{
            odd[v] = t;
        }
        for (auto &&u : E[v]) {
            if(u == p) continue;
            if(!odd_even(u, v, !t)) return false;
        } // end u
        return true;
    }

    bool dfs(int v, int p){
        for (auto &&u : E[v]) {
            if(u == p) continue;
            if(!dfs(u, v)) return false;
            auto r = vR[u];
            auto l = vL[u];
            min_update(vR[v], r+1);
            max_update(vL[v], l-1);
        } // end i
        if((abs(vL[v]) % 2) != odd[v]) vL[v]++;
        if((abs(vR[v]) % 2) != odd[v]) vR[v]--;

        return vL[v] <= vR[v];
    }

    bool det_answer(int v, ll l, ll r, int p = -1){
        vL[v] = max(l, vL[v]);
        vR[v] = min(r, vR[v]);
        if((abs(vL[v]) % 2) != odd[v]) vL[v]++;
        if((abs(vR[v]) % 2) != odd[v]) vR[v]--;
        if(vL[v] > vR[v]) return false;
        for (auto &&u : E[v]) {
            if(u == p) continue;
            if(!det_answer(u, vL[v]-1, vR[v]+1, v)) return false;
        } // end u
        return true;
    }


    void run(){
        ll N;
        is >> N;
        if(!is) return;
        vL.resize(N, -INF);
        vR.resize(N, INF);
        for (int i = 0; i < N - 1; ++i) {
            int a, b; is >> a >> b; a--;b--;
            E[a].insert(b); E[b].insert(a);
        } // end i
        ll K;
        is >> K;
        int v, p;
        for (int i = 0; i < K; ++i) {
            is >> v >> p; v--;
            vL[v] = vR[v] = p;
        } // end i
        odd.resize(N, false);
        if(odd_even(v, -1) and dfs(0, -1)){
            if(det_answer(0, -INF, INF)){
                cout << "Yes\n";
                for (int i = 0; i < N; ++i) {
                    cout << vL[i] << endl;
                } // end i
                return;
            }
        }
        cout << "No\n";

    }
};

int main(int argc, char *argv[]) {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(16) << scientific;
#ifdef DEBUG
    string test_cases = "test_IntegersOnATree.txt";
    cerr << test_cases << " -->" << endl;
    auto fs = fstream(test_cases, fstream::in);
    int loop = 0;
    while(fs) {
        loop++;
        cout << '#' << loop << "#------\n";
        solver(fs, cout).run();
    }
    if(loop <= 1) {
        cout << "===" << endl;
        while(cin) solver(cin, cout).run();
    }
#else
    solver(cin, cout).run();
#endif
    return 0;
}


Measured memory_bytes: 26404