#![allow(unused_imports, unused_macros)]

use kyoproio::*;
use std::{
    collections::*,
    io::{self, prelude::*},
    iter,
    mem::{replace, swap},
};

fn main() -> io::Result<()> {
    std::thread::Builder::new()
        .stack_size(64 * 1024 * 1024)
        .spawn(|| {
            let stdin = io::stdin();
            let stdout = io::stdout();
            run(KInput::new(stdin.lock()), io::BufWriter::new(stdout.lock()))
        })?
        .join()
        .unwrap();
    Ok(())
}

fn run<I: Input, O: Write>(mut kin: I, mut out: O) {
    macro_rules! output { ($($args:expr),+) => { write!(&mut out, $($args),+).unwrap(); }; }
    macro_rules! outputln {
        ($($args:expr),+) => { output!($($args),+); outputln!(); };
        () => { output!("\n"); if cfg!(debug_assertions) { out.flush().unwrap(); } }
    }

    let n: usize = kin.input();
    let mut g = vec![Vec::new(); n + 1];
    for (a, b) in kin.iter::<(usize, usize)>().take(n - 1) {
        g[a].push(b);
        g[b].push(a);
    }
    let k: usize = kin.input();
    let mut range = vec![(0, INF); n + 1];
    let mut r = 0;
    for (v, p) in kin.iter::<(usize, i32)>().take(k) {
        range[v] = (p, p);
        r = v;
    }

    if !dfs_parity(&g, &range, r, 0, range[r].1 & 1) {
        outputln!("No");
        return;
    }
    dfs1(&g, &mut range, 1, 0);
    dfs2(&g, &mut range, 1, 0);

    for u in 1..=n {
        let (l, r) = range[u];
        if l > r {
            outputln!("No");
            return;
        }
    }

    outputln!("Yes");
    for u in 1..=n {
        outputln!("{}", range[u].1);
    }
}

const INF: i32 = 100000000;

fn intersection((al, ar): (i32, i32), (bl, br): (i32, i32)) -> (i32, i32) {
    (al.max(bl), ar.min(br))
}
fn inc((l, r): (i32, i32)) -> (i32, i32) {
    (l.saturating_sub(1), r + 1)
}

fn dfs_parity(g: &[Vec<usize>], range: &[(i32, i32)], u: usize, p: usize, c: i32) -> bool {
    if range[u].1 != INF && (range[u].1 ^ c) & 1 == 1 {
        return false;
    }
    for &v in &g[u] {
        if v == p {
            continue;
        }
        if !dfs_parity(g, range, v, u, c ^ 1) {
            return false;
        }
    }
    true
}

fn dfs1(g: &[Vec<usize>], range: &mut [(i32, i32)], u: usize, p: usize) {
    for &v in &g[u] {
        if v == p {
            continue;
        }
        dfs1(g, range, v, u);
        range[u] = intersection(range[u], inc(range[v]));
    }
}

fn dfs2(g: &[Vec<usize>], range: &mut [(i32, i32)], u: usize, p: usize) {
    for &v in &g[u] {
        if v == p {
            continue;
        }
        range[v] = intersection(range[v], inc(range[u]));
        dfs2(g, range, v, u);
    }
}

// -----------------------------------------------------------------------------
pub mod kyoproio {
    use std::io::prelude::*;
    pub trait Input {
        fn str(&mut self) -> &str;
        fn input<T: InputParse>(&mut self) -> T {
            T::input(self)
        }
        fn iter<T: InputParse>(&mut self) -> Iter<T, Self> {
            Iter(self, std::marker::PhantomData)
        }
        fn seq<T: InputParse, B: std::iter::FromIterator<T>>(&mut self, n: usize) -> B {
            self.iter().take(n).collect()
        }
    }
    pub struct KInput<R> {
        src: R,
        buf: String,
        pos: usize,
    }
    impl<R: BufRead> KInput<R> {
        pub fn new(src: R) -> Self {
            Self {
                src,
                buf: String::with_capacity(1024),
                pos: 0,
            }
        }
        pub fn src(&mut self) -> &mut R {
            &mut self.src
        }
    }
    impl<R: BufRead> Input for KInput<R> {
        fn str(&mut self) -> &str {
            loop {
                if self.pos >= self.buf.len() {
                    self.pos = 0;
                    self.buf.clear();
                    if self.src.read_line(&mut self.buf).expect("io error") == 0 {
                        return &self.buf;
                    }
                }
                let range = self.pos
                    ..self.buf[self.pos..]
                        .find(|c: char| c.is_ascii_whitespace())
                        .map(|i| i + self.pos)
                        .unwrap_or_else(|| self.buf.len());
                self.pos = range.end + 1;
                if range.end > range.start {
                    return &self.buf[range];
                }
            }
        }
    }
    pub struct Iter<'a, T, I: ?Sized>(&'a mut I, std::marker::PhantomData<*const T>);
    impl<'a, T: InputParse, I: Input + ?Sized> Iterator for Iter<'a, T, I> {
        type Item = T;
        fn next(&mut self) -> Option<T> {
            Some(self.0.input())
        }
    }
    pub trait InputParse: Sized {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self;
    }
    impl InputParse for Vec<u8> {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self {
            src.str().as_bytes().to_owned()
        }
    }
    macro_rules! from_str_impl {
        { $($T:ty)* } => {
            $(impl InputParse for $T {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    src.str().parse::<$T>().expect("parse error")
                }
            })*
        }
    }
    from_str_impl! {
        String char bool f32 f64 isize i8 i16 i32 i64 i128 usize u8 u16 u32 u64 u128
    }
    macro_rules! tuple_impl {
        ($H:ident $($T:ident)*) => {
            impl<$H: InputParse, $($T: InputParse),*> InputParse for ($H, $($T),*) {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    ($H::input(src), $($T::input(src)),*)
                }
            }
            tuple_impl!($($T)*);
        };
        () => {}
    }
    tuple_impl!(A B C D E F G);
    #[macro_export]
    macro_rules! kdbg {
        ($($v:expr),*) => {
            if cfg!(debug_assertions) { dbg!($($v),*) } else { ($($v),*) }
        }
    }
}


Measured memory_bytes: 16792