#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <type_traits>
#include <cmath>
#include <cassert>
#include <cstdio>
 
using namespace std;
using namespace placeholders;
 
using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;
 
template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }
template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); }
 
#define NUMBERED( name, number ) NUMBERED2( name, number )
#define NUMBERED2( name, number ) name ## _ ## number
#define REP1( n ) REP2( NUMBERED( REP_COUNTER, __LINE__ ), n )
#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2, REP1 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a ) ( remove_all_extents< decltype( a ) >::type * )a, ( remove_all_extents< decltype( a ) >::type * )a + sizeof( a ) / sizeof( remove_all_extents< decltype( a ) >::type )
#define DRANGE( c, p ) begin( c ), begin( c ) + ( p ), end( c )
 
#define SZ( v ) ( (int)( v ).size() )
#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )
 
template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }
template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }
 
#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter
 
#define MP make_pair
#define fst first
#define snd second
 
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl
 
constexpr int INF = LIM<>::max() / 2;
 
VI value_range( const VVI &G, const VI &V, const VI &P, const VI &marked, const int sgn, VI &odd_even )
{
	const int N = SZ( G ), K = SZ( V );
 
	VI values( N, 0 < sgn ? INF : -INF );
	priority_queue< PII > que;
	REP( i, K )
	{
		values[ V[i] ] = P[i];
		que.EM( P[i] * -1 * sgn, V[i] );
		odd_even[ V[i] ] |= 1 << ( P[i] % 2 );
	}
 
	while ( !que.empty() )
	{
		const int val = que.top().fst;
		const int u = que.top().snd;
		que.pop();

		odd_even[u] |= 1 << ( val % 2 );
 
		if ( val * -1 * sgn != values[u] )
		{
			continue;
		}

		FOR( v, G[u] )
		{
			if ( marked[v] )
			{
				continue;
			}

			if ( 0 < sgn ? chmin( values[v], values[u] + sgn ) : chmax( values[v], values[u] + sgn ) )
			{
				que.EM( values[v] * -1 * sgn, v );
			}
		}
	}
 
	return move( values );
}
 
void coloring( const VVI &G, const VI &val_min, const VI &val_max, const int u, const int p, VI &res, const int prev = -1 )
{
	res[u] = p;
 
	FOR( v, G[u] )
	{
		for ( const int np : { p - 1, p + 1 } )
		{
			if ( v != prev && val_min[v] <= np && np <= val_max[v] )
			{
				coloring( G, val_min, val_max, v, np, res, u );
				break;
			}
		}
	}
 
	return;
}
 
int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );
	cout << setprecision( 12 ) << fixed;
 
	int N;
	scanf( "%d", &N );
 
	VVI G( N );
	REP( N - 1 )
	{
		int u, v;
		scanf( "%d%d", &u, &v );
		--u, --v;
		G[u].PB( v );
		G[v].PB( u );
	}
 
	int K;
	scanf( "%d", &K );
 
	VI V( K ), P( K );
	REP( i, K )
	{
		scanf( "%d%d", &V[i], &P[i] );
		--V[i];
	}
 
	VI marked( N );
	FOR( v, V )
	{
		marked[v] = 1;
	}

	VI odd_even( N );
	const VI val_min = value_range( G, V, P, marked, -1, odd_even ), val_max = value_range( G, V, P, marked, 1, odd_even );
 
	REP( i, N )
	{
		if ( val_max[i] < val_min[i] )
		{
			puts( "No" );
			fflush( stdout );
			return 0;
		}
	}
 
	VI res( N, INF );
	coloring( G, val_min, val_max, V[0], P[0], res );

	if ( find( ALL( res ), INF ) != end( res ) )
	{
		puts( "No" );
		fflush( stdout );
		return 0;
	}
 
	puts( "Yes" );
	FOR( r, res )
	{
		printf( "%d\n", r );
	}
	fflush( stdout );
 
	return 0;
}


Measured memory_bytes: 21180