#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

class mint {
public:
    static long long MOD;
    mint() :value(0) {}
    mint(long long val) :value(val<0 ? MOD + val % MOD : val % MOD) { }
    mint& operator+=(mint that) {
        value = value + that.value;
        if (value >= MOD)value -= MOD;
        return *this;
    }
    mint& operator-=(mint that) {
        value -= that.value;
        if (value<0)value += MOD;
        return *this;
    }
    mint& operator*=(mint that) {
        value = value * that.value % MOD;
        return *this;
    }
    mint &operator/=(mint that) {
        return *this *= that.inverse();
    }
    mint operator+(mint that) const {
        return mint(*this) += that;
    }
    mint operator-(mint that) const {
        return mint(*this) -= that;
    }
    mint operator*(mint that) const {
        return mint(*this) *= that;
    }
    mint operator/(mint that) const {
        return mint(*this) /= that;
    }
    mint operator^(long long k) const {
        if (value == 0)return 0;
        mint n = *this, res = 1;
        while (k) {
            if (k & 1)res *= n;
            n *= n;
            k >>= 1;
        }
        return res;
    }
    mint inverse() const {
        long long a = value, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        return mint(u);
    }
    long long toll() const { return value; }
    int toi() const { return (int)value; }

private:
    long long value;
};
long long mint::MOD = 1000000007ll;
ostream& operator<<(ostream& os, const mint& x) {
    os << x.toi();
    return os;
}

vi G[100005];
mint dp[100005], dpdp[100005];
vector<mint> L[100005], R[100005];

void f(int u, int p) {
    mint &re = dp[u];
    re = 1;
    each(v, G[u])if (v != p) {
        f(v, u);
        re *= dp[v] + 1;
    }
}

void g(int u, int p, mint x) {
    int m = 0;
    each(v, G[u])if (v != p)m++;

    L[u].resize(m + 1, 1);
    R[u].resize(m + 1, 1);
    
    int k = 0;
    each(v, G[u])if (v != p) {
        L[u][k + 1] = L[u][k] * (dp[v] + 1);
        k++;
    }
    for (int i = sz(G[u]) - 1; i >= 0; --i) {
        int v = G[u][i];
        if (v == p)continue;
        R[u][k - 1] = R[u][k] * (dp[v] + 1);
        k--;
    }

    mint &re = dpdp[u];
    re = (x + 1) * dp[u];
    k = 0;
    each(v, G[u])if (v != p) {
        mint xx = (x + 1)*L[u][k] * R[u][k + 1];
        g(v, u, xx);
        k++;
    }
}

void solve() {
    int N;
    cin >> N >> mint::MOD;

    rep(i, N - 1) {
        int x, y;
        cin >> x >> y;
        --x;
        --y;
        G[x].push_back(y);
        G[y].push_back(x);
    }

    f(0, -1);
    g(0, -1, 0);

    rep(i, N) {
        cout << dpdp[i] << endl;
    }
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}

Measured memory_bytes: 27008