macro_rules ! input { ( source = $ s : expr , $ ( $ r : tt ) * ) => { let mut iter = $ s . split_whitespace ( ) ; input_inner ! { iter , $ ( $ r ) * } } ; ( $ ( $ r : tt ) * ) => { let s = { use std :: io :: Read ; let mut s = String :: new ( ) ; std :: io :: stdin ( ) . read_to_string ( & mut s ) . unwrap ( ) ; s } ; let mut iter = s . split_whitespace ( ) ; input_inner ! { iter , $ ( $ r ) * } } ; }
macro_rules ! input_inner { ( $ iter : expr ) => { } ; ( $ iter : expr , ) => { } ; ( $ iter : expr , mut $ var : ident : $ t : tt $ ( $ r : tt ) * ) => { let mut $ var = read_value ! ( $ iter , $ t ) ; input_inner ! { $ iter $ ( $ r ) * } } ; ( $ iter : expr , mut $ var : ident $ ( $ r : tt ) * ) => { let mut $ var = $ iter . next ( ) . unwrap ( ) . parse ::< usize > ( ) . unwrap ( ) ; input_inner ! { $ iter $ ( $ r ) * } } ; ( $ iter : expr , $ var : ident : $ t : tt $ ( $ r : tt ) * ) => { let $ var = read_value ! ( $ iter , $ t ) ; input_inner ! { $ iter $ ( $ r ) * } } ; ( $ iter : expr , $ var : ident $ ( $ r : tt ) * ) => { let $ var = $ iter . next ( ) . unwrap ( ) . parse ::< usize > ( ) . unwrap ( ) ; input_inner ! { $ iter $ ( $ r ) * } } ; }
macro_rules ! read_value { ( $ iter : expr , ( $ ( $ t : tt ) ,* ) ) => { ( $ ( read_value ! ( $ iter , $ t ) ) ,* ) } ; ( $ iter : expr , [ $ t : tt ; $ len : expr ] ) => { ( 0 ..$ len ) . map ( | _ | read_value ! ( $ iter , $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ iter : expr , chars ) => { read_value ! ( $ iter , String ) . chars ( ) . collect ::< Vec < char >> ( ) } ; ( $ iter : expr , usize1 ) => { read_value ! ( $ iter , usize ) - 1 } ; ( $ iter : expr , $ t : ty ) => { $ iter . next ( ) . unwrap ( ) . parse ::<$ t > ( ) . unwrap ( ) } ; }
#[allow(unused_imports)]
use std::io::{stdout, BufWriter, StdoutLock, Write};
fn with_bufwriter<F: FnOnce(&mut BufWriter<StdoutLock>) -> std::io::Result<()>>(
    f: F,
) -> std::io::Result<()> {
    let stdout = stdout();
    let mut writer = BufWriter::new(stdout.lock());
    f(&mut writer)
}
fn dfs(u: usize, p: usize, m: usize, graph: &Vec<Vec<usize>>, dp: &mut Vec<Vec<usize>>) {
    dp[u][0] = (dp[p][0] + 1) % m;
    dp[u][1] = 1;
    for &v in &graph[u] {
        if v == p {
            continue;
        }
        dfs(v, u, m, graph, dp);
        dp[u][1] *= dp[v][1] + 1;
        dp[u][1] %= m;
    }
}
fn dfs2(u: usize, p: usize, m: usize, graph: &Vec<Vec<usize>>, dp: &mut Vec<Vec<usize>>) {
    let mut ch = vec![dp[p][2] + 1];
    for &v in &graph[u] {
        if v == p {
            continue;
        }
        ch.push((dp[v][1] + 1) % m);
    }
    let n = ch.len();
    let mut left = vec![1; n];
    let mut right = vec![1; n];
    for i in 0..(n - 1) {
        left[i + 1] = left[i] * ch[i] % m;
        right[n - 2 - i] = right[n - 1 - i] * ch[n - 1 - i] % m;
    }
    let mut i = 1;
    for &v in &graph[u] {
        if v == p {
            continue;
        }
        dp[u][2] = left[i] * right[i] % m;
        dfs2(v, u, m, graph, dp);
        i += 1;
    }
    dp[u][2] = (dp[p][2] + 1) * dp[u][1];
    dp[u][2] %= m;
}
fn main() {
    input! { n, m, xy: [(usize, usize); n-1] };
    let mut dp = vec![vec![0; 3]; n + 1];
    let mut graph = vec![vec![]; n + 1];
    for &(x, y) in &xy {
        graph[x].push(y);
        graph[y].push(x);
    }
    dfs(1, 0, m, &graph, &mut dp);
    dfs2(1, 0, m, &graph, &mut dp);
    with_bufwriter(|out| {
        for v in 1..(n + 1) {
            writeln!(out, "{}", dp[v][2])?;
        }
        Ok(())
    })
    .unwrap();
}


Measured memory_bytes: 39548