#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair

template<class T> inline void amin(T & a, T const & b) { a = min(a, b); }
template<class T> inline void amax(T & a, T const & b) { a = max(a, b); }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }


ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
template <typename T>
T mod(T a, T b) { return ((a % b) + b) % b; }

ll MOD;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }


vvi nxt;
vector<unordered_map<int,int>> nxtR;

vector<vll> dp;
vi degr, pi;
vll ans;

ll dfs(int u, int p=-1) {
    ll ans = 1;

    int D = nxt[u].size();
    rep(i,D){
        int v = nxt[u][i];
        if (v == p) {
            pi[u] = i;
            continue;
        }
        if (dp[u][i] == -1) {
            dp[u][i] = dfs(v,u);
        }
        (ans *= (dp[u][i] + 1)) %= MOD;
    }
    return ans;
}

void bfs(int u, ll res_p=0, int p=-1) {
    if (p != -1) {
        assert(IN(pi[u], 0, (int)dp[u].size()-1));
        dp[u][pi[u]] = res_p;
    }
    int D = nxt[u].size();

    vll acc_left(D+1), acc_right(D+1);
    acc_left[0] = acc_right[D] = 1;
    for (int i=0; i<D; ++i) {
        assert(IN(i, 0, dp[u].size()));
        acc_left[i+1] = (acc_left[i] * (dp[u][i] + 1)) % MOD;
    }
    for (int i=D-1; i>=0; --i) {
        assert(IN(i, 0, dp[u].size()));
        acc_right[i] = (acc_right[i+1] * (dp[u][i] + 1)) % MOD;
    }
    ans[u] = acc_right[0];
    rep(i,D) {
        int v = nxt[u][i];
        if (v == p) continue;
        bfs(v, (acc_left[i] * acc_right[i+1]) % MOD, u);
    }
}

void solve(int N,int M,vi& x,vi& y) {
    MOD = M;

    nxt.resize(N);
    dp.resize(N);
    pi.resize(N);
    ans.resize(N);

    rep(i,N-1){
        int u=x[i]-1, v=y[i]-1;
        nxt[u].pb(v);
        nxt[v].pb(u);
    }

    rep(u,N) {
        int D = nxt[u].size();
        dp[u].assign(D, -1);
    }

    dfs(0);
    bfs(0);

    rep(u,N) {
        printf("%lld\n", ans[u]);
    }
}

int main() {
    int N, M; scanf("%d%d", &N, &M);
    vi x(N-1), y(N-1);
    rep(i, N-1) {
        scanf("%d%d", &x[i], &y[i]);
    }
    solve(N,M,x,y);
    return 0;
}


Measured memory_bytes: 24320