#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 200010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 29;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

int N, K;
vector<int> G[MAX_N];
int ans[MAX_N];
int A[MAX_N];
int minv[MAX_N], maxv[MAX_N];

bool loop(int v, int p) {
	// debug(v);
	int tminv = -inf, tmaxv = inf;
	if(A[v] != -inf) {
		tminv = A[v];
		tmaxv = A[v];
	}
	rep(i, 0, sz(G[v])) {
		int n = G[v][i];
		if(n == p) continue;
		if(!loop(n, v)) return false;
		int pminv = minv[n], pmaxv = maxv[n];
		pminv--; pmaxv++;
		if(tminv <= -inf) {
			tminv = pminv;
			tmaxv = pmaxv;
		}
		else {
			if(pminv <= -inf) continue;
			if(abs(tminv - pminv) % 2 == 1) {
				return false;
			}
			else {
				MAX(tminv, pminv);
				MIN(tmaxv, pmaxv);
			}
		}
	}
	if(tminv > tmaxv) {
		return false;
	}
	else {
		minv[v] = tminv;
		maxv[v] = tmaxv;
		// debug(v, minv[v], maxv[v]);
		return true;
	}
}

void loop2(int v, int p) {
	if(p == -1) {
		ans[v] = minv[v];
	}
	else {
		int tmp = ans[p]; tmp--;
		MAX(tmp, minv[v]);
		ans[v] = tmp;
	}
	rep(i, 0, sz(G[v])) {
		int n = G[v][i];
		if(n == p) continue;
		loop2(n, v);
	}
}

void solve() {
	cin >> N;
	rep(i, 0, N - 1) {
		int a, b; cin >> a >> b; a--; b--;
		G[a].pb(b); G[b].pb(a);
	}
	fill(A, A + N, -inf);
	cin >> K;
	rep(i, 0, K) {
		int a, b;
		cin >> a >> b; a--;
		A[a] = b;
	}
	if(!loop(0, -1)) {
		cout << "No\n";
		return;
	}
	else cout << "Yes\n";
	loop2(0, -1);
	rep(i, 0, N) {
		cout << ans[i] << "\n";
	}
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
	srand((unsigned int)time(NULL));
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif	
	solve();
#ifdef LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}



Measured memory_bytes: 18816