#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <utility>
#include <memory>
#include <functional>
#include <deque>
#include <cctype>
#include <ctime>
#include <numeric>
#include <list>
#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll;
typedef vector<vector<long long> > vvll;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}

#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i,n) _rep2((i),0,(n))
#define _rep2(i,a,b) for(int i=(a);i<(b);++i)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define fi first
#define se second
#define mkp make_pair
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif

#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)

int n;
vvint vv;
int K;
vint v;
vector<pii> seg;
vint ans;

pii dfs(int x, int p){
	// cout<<"dfs "<<x<<" "<<p<<endl;
	pii ret(-INF,INF);
	bool odd = false;
	bool even = false;
	// vector<pii> tt;
	for(int y: vv[x]){
		if(y==p) continue;
		pii t = dfs(y, x);
		if(t.fi == -INF) continue;
		if(t.fi>t.se){
			ret = pii(1000000,-11111111);
			continue;
		}
		if(t.fi&1) even = true;
		else odd = true;
		// tt.PB(t);
		maxs(ret.fi, t.fi-1);
		mins(ret.se, t.se+1);
	}
	if(v[x]>=0){
		// if(v[x]&1) odd = true;
		// else even = true;
		maxs(ret.fi, v[x]);
		mins(ret.se, v[x]);
	}
	if(ret.fi>ret.se){
		ret = pii(1000000,-11111111);
	}
	if(ret.fi<=ret.se && (ret.se-ret.fi)%2){
		ret = pii(1000000,-11111111);
	}
	if(odd && even){
		// rep(i,tt.size()){
		// 	cout<<tt[i].fi<<" "<<tt[i].se<<endl;
		// }
		// cout<<endl;
		ret = pii(1000000,-11111111);
	}
	seg[x] = ret;
	// cout<<"x "<<x<<" "<<seg[x].fi<<" "<<seg[x].se<<endl;
	return ret;
}

void dfs2(int x, int p, int l, int r){
	maxs(l, seg[x].fi);
	mins(r, seg[x].se);
	ans[x] = l;
	for(int y: vv[x]){
		if(y==p) continue;
		dfs2(y, x, l-1, l+1);
	}
}

void mainmain(){
	cin>>n;
	vv = vvint(n);
	rep(i,n-1){
		int a,b;
		cin>>a>>b;
		a--,b--;
		vv[a].PB(b);
		vv[b].PB(a);
		// cout<<"push "<<a<<" "<<b<<endl;
	}
	cin>>K;
	v = vector<int>(n,-INF);
	seg = vector<pii>(n);
	rep(i,K){
		int a,b;
		cin>>a>>b;
		a--;
		v[a] = b;
	}
	pii t = dfs(0,-1);
	if(t.fi>t.se || (t.se-t.fi)%2){
		cout<<"No"<<endl;
		return;
	}
	cout<<"Yes"<<endl;
	ans = vint(n);
	dfs2(0, -1, -INF, INF);
	rep(i,n){
		cout<<ans[i]<<endl;
	}
}


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout<<fixed<<setprecision(20);
    mainmain();
}

Measured memory_bytes: 17408