// Slower C++ solution:
/*************************************************

 *************************************************

 *************************************************

 *** _________________  |            |  |     /***

 ***         |          |            |  |    / ***

 ***         |          |            |  |   /  ***

 ***         |          |            |  |  /   ***

 ***         |          |            |  | /    ***

 ***         |          |____________|  |/  en ***

 ***         |          |            |  |\     ***

 ***         |          |            |  | \    ***

 *** _____   |          |            |  |  \   ***

 ***   |     |          |            |  |   \  ***

 ***   \     /          |            |  |    \ ***

 ***    \___/           |            |  |     \***

 *************************************************

 *************Written by: JiangHaoKai*************

 *************************************************/

#pragma GCC optimize(2)

#pragma G++ optimize(2)



//#include <bits/stdc++.h>

#include <cassert>

#include <cctype>

#include <cerrno>

#include <cfloat>

#include <climits>

#include <clocale>

#include <cmath>

#include <csetjmp>

#include <csignal>

#include <cstdarg>

#include <cstddef>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <ctime>

#include <ccomplex>

#include <cfenv>

#include <cinttypes>

#include <cstdalign>

#include <cstdbool>

#include <cstdint>

#include <ctgmath>

#include <cwchar>

#include <cwctype>

#include <algorithm>

#include <bitset>

#include <complex>

#include <deque>

#include <fstream>

#include <functional>

#include <iomanip>

#include <iostream>

#include <limits>

#include <list>

#include <locale>

#include <map>

#include <memory>

#include <numeric>

#include <queue>

#include <set>

#include <sstream>

#include <stack>

#include <stdexcept>

#include <string>

#include <typeinfo>

#include <valarray>

#include <vector>

#include <array>

#include <atomic>

#include <chrono>

#include <condition_variable>

#include <forward_list>

#include <future>

#include <mutex>

#include <random>

#include <ratio>

#include <regex>

#include <scoped_allocator>

#include <system_error>

#include <thread>

#include <tuple>

#include <typeindex>

#include <unordered_map>

#include <unordered_set>

//#include <conio.h>

//#include <windows.h>

using namespace std;



typedef long long LL;

typedef unsigned int ui;

typedef unsigned long long ull;

typedef float fl;

typedef double ld;

typedef pair<int,int> pii;

#define ui(n) ((unsigned int)(n))

#define ll(n) ((long long)(n))

#define ull(n) ((unsigned long long)(n))

#define fl(n) ((float)(n))

#define ld(n) ((double)(n))

#define char(n) ((char)(n))

#define Bool(n) ((bool)(n))

#define fixpoint(n) fixed<<setprecision(n)

const int INF=1061109567;

const LL LINF=4557430888798830399;

#define PI 3.1415926535897932384626433832795028841971

#define MP make_pair

#define MT make_tuple

#define All(a) (a).begin(),(a).end()

#define pall(a) (a).rbegin(),(a).rend()

#define mod 1000000007

#define sz(a) ((int)(a).size())

#define rep(i,n) for(int i=0;i<n;i++)

#define rep1(i,n) for(int i=1;i<=n;i++)

#define repa(i,a,n) for(int i=a;i<n;i++)

#define repa1(i,a,n) for(int i=a;i<=n;i++)

#define repd(i,n) for(int i=n-1;i>=0;i--)

#define repd1(i,n) for(int i=n;i>=1;i--)

#define repda(i,n,a) for(int i=n;i>a;i--)

#define repda1(i,n,a) for(int i=n;i>=a;i--)

#define FOR(i,a,n,step) for(int i=a;i<n;i+=step)

#define repv(itr,v) for(__typeof((v).begin()) itr=(v).begin();itr!=(v).end();itr++)

#define repV(i,v) for(auto i:v)

#define repE(i,v) for(auto &i:v)

#define MS(x,y) memset(x,y,sizeof(x))

#define MC(x) MS(x,0)

#define MCP(x,y) memcpy(x,y,sizeof(y))

#define sqr(x) ((x)*(x))

#define filein(x) freopen(x,"r",stdin)

#define fileout(x) freopen(x,"w",stdout)

#define fileout2(filename,name) ofstream name(filename,ios::out)

#define filein2(filename,name) ifstream name(filename,ios::in)

#define file(filename,name) fstream name(filename,ios::in|ios::out)

#define Pause system("pause")

#define Cls system("cls")

#define fs first

#define sc second

#define PC(x) putchar(x)

#define GC(x) x=getchar()

#define Endl PC('\n')

#define SF scanf

#define PF printf



inline int Read()

{

    int X=0,w=0;char ch=0;while(!isdigit(ch)){w|=ch=='-';ch=getchar();}while(isdigit(ch))X=(X<<3)+(X<<1)+(ch^48),ch=getchar();

	return w?-X:X;

}

inline void Write(int x){if(x<0)putchar('-'),x=-x;if(x>9)Write(x/10);putchar(x%10+'0');}



inline LL powmod(LL a,LL b){LL res=1;a%=mod;assert(b>=0);for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}

inline LL gcdll(LL a,LL b){return b?gcdll(b,a%b):a;}

const int dx[]={0,1,0,-1,1,-1,-1,1};

const int dy[]={1,0,-1,0,-1,-1,1,1};

/**************************************************************Begin***************************************************************/

const int maxn=100010;



int n,k,d[maxn];

vector<int> e[maxn];

priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > q;



int main()

{

	SF("%d",&n);

	rep(i,n-1)

	{

		int x,y;SF("%d%d",&x,&y);x--;y--;

		e[x].push_back(y);

		e[y].push_back(x);

	}

	

	MS(d,-1);

	SF("%d",&k);

	rep(i,k)

	{

		int v,p;SF("%d%d",&v,&p);v--;

		d[v]=p;

		q.push({p,v});

	}

	

	while(!q.empty())

	{

		int x=q.top().sc;q.pop();

		repV(i,e[x]) if(d[i]==-1)

		{

			d[i]=d[x]+1;

			q.push({d[i],i});

		}

	}

	

	rep(i,n) repV(j,e[i]) if(abs(d[i]-d[j])!=1) return !PF("No");

	

	PF("Yes\n");

	rep(i,n) PF("%d\n",d[i]);



	return 0;

}

/***************************************************************End****************************************************************/


// Faster C++ solution for the same problem (measured speedup: 4.517109664904709x):
#include <bits/stdc++.h>

using namespace std;

const int N=1e5+5;

int n,u,v,x,k;

int a[N];

bool vis[N];

int cnt,head[N];

struct edge{int next,to;}e[N<<1];



struct node

{

	int id,v;

	inline bool operator < (const node &x) const

	{

		return x.v<v; 

	}

};



inline void add(int u,int v)

{

	cnt++;

	e[cnt].next=head[u];

	e[cnt].to=v;

	head[u]=cnt;

}



priority_queue<node>q;



int main(){

	scanf("%d",&n);

	for (register int i=1; i<n; ++i) scanf("%d%d",&u,&v),add(u,v),add(v,u);

	scanf("%d",&k);

	while (k--) 

	{

		scanf("%d%d",&u,&x);

		a[u]=x; vis[u]=true;

		q.push((node){u,x});

	}

	bool jay=true;

	while (q.size())

	{

		node u=q.top(); q.pop();

		for (register int i=head[u.id]; i; i=e[i].next)

		if (!vis[e[i].to])

		{

			vis[e[i].to]=true;

			a[e[i].to]=a[u.id]+1;

			q.push((node){e[i].to,a[e[i].to]});

		}

		else

		{

			if (a[e[i].to]!=a[u.id]+1 && a[e[i].to]!=a[u.id]-1) {jay=false; break;}

		}

	}

	if (!jay) puts("No");

	else

	{

		puts("Yes");

		for (register int i=1; i<=n; ++i) printf("%d\n",a[i]);

	}

return 0;	

}