#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i,s,n) for (int i = (s); i < (n); ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vd vector<double>
#define vs vector<string>
#define vc vector<char>
#define vb vector<bool>
#define vp vector<P>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using LP = pair<ll,ll>;
template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }
template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }
template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==v.size()-1?']':','); return os; }
void Yes(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YES(bool b) { cout << (b ? "YES" : "NO") << endl; }
template<class T> bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
const int inf = 1001001001;
const ll linf = 1001001001001001001;

int mod;
//const int mod = 998244353;
struct mint {
    ll x;
    mint(ll x=0):x((x%mod+mod)%mod){}
    mint operator-() const { return mint(-x);}
    mint& operator+=(const mint& a) { if ((x += a.x) >= mod) x -= mod; return *this;}
    mint& operator++() { return *this += mint(1); }
    mint& operator-=(const mint& a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; }
    mint& operator--() { return *this -= mint(1); }
    mint& operator*=(const mint& a) { (x *= a.x) %= mod; return *this; }
    mint operator+(const mint& a) const { mint res(*this); return res+=a; }
    mint operator-(const mint& a) const { mint res(*this); return res-=a; }
    mint operator*(const mint& a) const { mint res(*this); return res*=a; }
    mint pow(ll t) const {
        mint res = mint(1),a(*this);
        while(t > 0) {
            if(t&1) res *= a;
            t >>= 1;
            a *= a;
        }
        return res;
    }
    // for prime mod
    mint inv() const { return pow(mod-2); }
    mint& operator/=(const mint& a) { return *this *= a.inv(); }
    mint operator/(const mint& a) const { mint res(*this); return res/=a; }
};
ostream& operator<<(ostream& os,const mint& m) { return os << m.x; }

template<typename T,typename MERGE,typename ADDROOT> // monoid
class rerooting {
    int n;
    vvi tree;
    T identity;
    MERGE merge;
    ADDROOT addRoot;
    vector<vector<T>> dp;
    vector<T> ans;

    T dfs(int v = 0,int p = -1) {
        T sum = identity;
        dp[v].resize(tree[v].size());
        rep(i,tree[v].size()) {
            int u = tree[v][i];
            if(u == p) continue;
            dp[v][i] = dfs(u,v);
            sum = merge(sum,dp[v][i]);
        }
        return addRoot(sum);
    }
    void dfs2(T dpP,int v = 0,int p = -1) {
        int sz = tree[v].size();
        rep(i,sz) if(tree[v][i] == p) dp[v][i] = dpP;
        vector<T> sumL(sz+1,identity),sumR(sz+1,identity);
        rep(i,sz) sumL[i+1] = merge(sumL[i],dp[v][i]);
        rrep(i,sz) sumR[i] = merge(sumR[i+1],dp[v][i]);
        ans[v] = addRoot(sumL[sz]);
        rep(i,sz) {
            int u = tree[v][i];
            if(u == p) continue;
            T t = merge(sumL[i],sumR[i+1]);
            dfs2(addRoot(t),u,v);
        }
    }
    void init() {
        dfs();
        dfs2(identity);
    }

public:
    rerooting(int n,vvi tree,T identity,MERGE merge,ADDROOT addRoot)
            :n(n),tree(tree),identity(identity),merge(merge),addRoot(addRoot),dp(n),ans(n) {
        init();
    };
    T get_ans(int i) {
        return ans[i];
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    int n;
    cin >> n >> mod;
    vvi v(n);
    rep(i,n-1) {
        int x,y;
        cin >> x >> y;
        x--; y--;
        v[x].pb(y);
        v[y].pb(x);
    }
    auto f = [](mint a,mint b){ return a*b; };
    auto g = [](mint a){ return a+1; };
    rerooting<mint, decltype(f), decltype(g)> rt(n,v,1,f,g);
    rep(i,n) cout << rt.get_ans(i)-1 << endl;
}


Measured memory_bytes: 32384