// Template
#include <bits/stdc++.h>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define per(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
constexpr int inf = 1001001001;
constexpr ll INF = 3003003003003003003LL;
template <typename T> inline bool chmin(T& x, const T& y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T> inline bool chmax(T& x, const T& y) {if (x < y) {x = y; return 1;} return 0;}
struct IOSET {IOSET() {cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(10);}} ioset;
template <typename Head, typename... Tail> tuple<Head, Tail...> IN() {
    Head head; cin >> head;
    if constexpr (sizeof...(Tail) == 0) return tuple<Head>(head);
    else return tuple_cat(tuple<Head>(head), IN<Tail...>());
}

// Mod-Int
int MOD;
struct ModInt {
    ll val;
    ModInt() = default;
    ModInt(ll x) : val(x % MOD + (x < 0 ? MOD : 0)) {}
    ModInt &operator+= (const ModInt &x) {if ((val += x.val) >= MOD) val -= MOD; return *this;}
    ModInt &operator-= (const ModInt &x) {if ((val -= x.val) < 0) val += MOD; return *this;}
    ModInt &operator*= (const ModInt &x) {val *= x.val; val %= MOD; return *this;}
    ModInt operator+ (const ModInt &x) const {return ModInt(*this) += x;}
    ModInt operator- (const ModInt &x) const {return ModInt(*this) -= x;}
    ModInt operator* (const ModInt &x) const {return ModInt(*this) *= x;}
    ModInt pow(ll t) const {
        if (!t) return ModInt(1);
        ModInt m = pow(t / 2);
        m *= m;
        if (t & 1) m *= *this;
        return m;
    }
    ModInt inv() const {return pow(MOD - 2);}
    ModInt &operator/= (const ModInt &x) {return *this *= x.inv();}
    ModInt operator/ (const ModInt &x) const {return ModInt(*this) /= x;}
    friend istream &operator>> (istream &is, ModInt &x) {is >> x.val; return is;}
    friend ostream &operator<< (ostream &os, const ModInt &x) {os << x.val; return os;}
};

// Main
int main() {
    auto [n, m] = IN<int, int>();
    MOD = m;
    vector<vector<int>> g(n);
    rep(i, n - 1) {
        auto [a, b] = IN<int, int>();
        --a; --b;
        g[a].push_back(b); g[b].push_back(a);
    }
    
    vector<vector<ModInt>> dp(n);
    vector<vector<bool>> solved(n);
    rep(i, n) {
        dp[i] = vector<ModInt>(g[i].size(), ModInt(0));
        solved[i] = vector<bool>(g[i].size(), false);
    }
    
    auto dfs0 = [&](auto f, int v, int p) -> ModInt {
        ModInt res(1);
        rep(i, g[v].size()) {
            if (g[v][i] == p) continue;
            ModInt x = f(f, g[v][i], v);
            dp[v][i] = x;
            solved[v][i] = true;
            res *= (x + 1);
        }
        return res;
    };
    dfs0(dfs0, 0, -1);
    
    auto dfs1 = [&](auto f, int v, ModInt x) -> void {
        vector<ModInt> vec;
        rep(i, g[v].size()) {
            if (!solved[v][i]) dp[v][i] = x;
            vec.push_back(dp[v][i]);
        }
        vector<ModInt> left_sum(vec.size() + 1, ModInt(1)), right_sum(vec.size() + 1, ModInt(1));
        rep(i, vec.size()) left_sum[i + 1] = left_sum[i] * (vec[i] + ModInt(1));
        per(i, vec.size()) right_sum[i] = right_sum[i + 1] * (vec[i] + ModInt(1));
        rep(i, g[v].size()) {
            if (solved[v][i]) f(f, g[v][i], left_sum[i] * right_sum[i + 1]);
        }
    };
    dfs1(dfs1, 0, ModInt(0));
    
    rep(i, n) {
        ModInt res(1);
        rep(j, g[i].size()) res *= (dp[i][j] + ModInt(1));
        cout << res << "\n";
    }
}


Measured memory_bytes: 38164