#include<cstdio>
#include<algorithm>
using namespace std; 
inline int read()
{
	int x;char c;
	while((c=getchar())<'0'||c>'9');
	for(x=c-'0';(c=getchar())>='0'&&c<='9';)x=x*10+c-'0';
	return x;
}
#define MN 100000
struct edge{int nx,t;}e[MN*2+5];
int h[MN+5],en,v[MN+5],l[MN+5],r[MN+5],o;
inline void ins(int x,int y)
{
	e[++en]=(edge){h[x],y};h[x]=en;
	e[++en]=(edge){h[y],x};h[y]=en;
}
void dfs(int x,int fa)
{
	l[x]=r[x]=v[x]?v[x]:1e9;
	for(int i=h[x];i;i=e[i].nx)if(e[i].t!=fa)
	{
		dfs(e[i].t,x);
		if(l[e[i].t]==1e9)continue;
		if(l[x]==1e9){l[x]=l[e[i].t]-1;r[x]=r[e[i].t]+1;continue;}
		if(~(l[x]-l[e[i].t])&1)o=1;
		l[x]=max(l[x],l[e[i].t]-1);r[x]=min(r[x],r[e[i].t]+1);
	}
	if(l[x]>r[x])o=1;
}
void solve(int x,int fa)
{
	for(int i=h[x];i;i=e[i].nx)if(e[i].t!=fa)
	{
		if(l[e[i].t]==1e9)l[e[i].t]=l[x]-1;
		else l[e[i].t]=max(l[e[i].t],l[x]-1);
		solve(e[i].t,x);
	}
}
int main()
{
	int n=read(),k,i;
	for(i=1;i<n;++i)ins(read(),read());
	for(k=read();k--;)i=read(),v[i]=read()+1;
	dfs(1,0);
	if(o)return 0*puts("No");puts("Yes");
	solve(1,0);
	for(i=1;i<=n;++i)printf("%d\n",l[i]-1);
}