#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)
#define ALL(container) (container).begin(), (container).end()
#define RALL(container) (container).rbegin(), (container).rend()
#define SZ(container) ((int)container.size())
#define mp(a,b) make_pair(a, b)
#define pb push_back
#define eb emplace_back
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define __builtin_popcount __builtin_popcountll

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
    os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
template<class T> ostream& operator<<(ostream &os, const set<T> &t) {
    os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const map<S, T> &t) {
    os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}

const int INF = 1<<28;
const double EPS = 1e-8;
int MOD;
struct handler{
    typedef ll val_t;
    handler(){}
    static val_t def_val(){ return 1; }
    static val_t merge(const val_t &l, const val_t &r){
        return l * r % MOD;
    }
};

template <class Handler>
struct UnrootedTreeDP {
    typedef typename Handler::val_t val_t;
    int n;
    vector<vi> g;
    vector<vector<val_t>> memo;
    vector<val_t> dp;
    UnrootedTreeDP(const vector<vi> &g) :g(g), n(g.size()), dp(n), memo(n) {
        REP(i, n) {
            memo[i].resize(g[i].size());
        }
        dfs1(0, -1);
        dfs2(0, -1, 0);
    }

    val_t get(int u) {
        return dp[u];
    }
    val_t dfs1(int u, int p) {
        val_t res = Handler::def_val();
        REP(i, g[u].size()) {
            if (g[u][i] != p) {
                res = Handler::merge(res, dfs1(g[u][i], u) + 1);
            }
        }
        return dp[u] = res;
    }

    val_t dfs2(int u, int p, val_t pv) {
        vector<val_t> sum(g[u].size() + 1, Handler::def_val());
        RREP(i, g[u].size()) {
            sum[i] = Handler::merge((g[u][i] == p ? pv : dp[g[u][i]]) + 1, sum[i + 1]);
        }
        val_t res = Handler::def_val();
        REP(i, g[u].size()) {
            val_t ret = (g[u][i] == p ? pv : dp[g[u][i]]);
            if (g[u][i] != p) {
                dfs2(g[u][i], u, Handler::merge(res, sum[i + 1]));
            }
            res = Handler::merge(res, ret + 1);
        }
        return dp[u] = res;
    }
};

int T, n, m;
vector<vi> g;

int main(int argc, char *argv[]){
    ios::sync_with_stdio(false);
    while(cin >> n >> MOD){
        g = vector<vi>(n);
        REP(i, n-1) {
            int u, v;
            cin >> u >> v; u--; v--;
            g[u].push_back(v);
            g[v].push_back(u);
        }
        UnrootedTreeDP<handler> tdp(g);
        REP(i, n) {
            cout << tdp.get(i) << endl;
        }
    }
    return 0;
}


Measured memory_bytes: 26240