#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10, M = N << 1;
#define int long long
#define endl "\n"
// 链式前向星
int e[M], h[N], idx, w[M], ne[M];
void add(int a, int b, int c = 0) {
    e[idx] = b, ne[idx] = h[a], w[idx] = c, h[a] = idx++;
}

int f[N], g[N], son[N], ans[N];
int n, mod;
vector<int> val[N], pre[N], suc[N];

void dfs1(int u, int fa) {
    int tmp = 1;
    val[u].push_back(1);
    for (int i = h[u]; ~i; i = ne[i]) {
        int v = e[i];
        if (v == fa) continue;
        dfs1(v, u);
        son[u]++;
        val[u].push_back(f[v] + 1);
        tmp = tmp * (f[v] + 1) % mod;
    }
    f[u] = tmp;
}

void dfs2(int u, int fa) {
    if (u == 1) g[u] = 1;
    ans[u] = f[u] * g[u] % mod;
    pre[u].resize(son[u] + 2);
    suc[u].resize(son[u] + 2);
    pre[u][0] = suc[u][son[u] + 1] = 1;
    for (int i = 1; i <= son[u]; i++) pre[u][i] = (ll)pre[u][i - 1] * val[u][i] % mod;
    for (int i = son[u]; i >= 1; i--) suc[u][i] = (ll)suc[u][i + 1] * val[u][i] % mod;
    int m = 0;
    for (int i = h[u]; ~i; i = ne[i]) {
        int v = e[i];
        if (v == fa) continue;
        m++;
        g[v] = g[u] * pre[u][m - 1] % mod * suc[u][m + 1] % mod;
        g[v] = (g[v] + 1) % mod;
        dfs2(v, u);
    }
}

signed main() {
    // 初始化链式前向星
    memset(h, -1, sizeof h);
    cin >> n >> mod;
    for (int i = 1; i < n; i++) {
        int a, b;
        cin >> a >> b;
        add(a, b), add(b, a);
    }
    dfs1(1, 0);
    dfs2(1, 0);
    for (int i = 1; i <= n; i++) cout << ans[i] << endl;
}