#pragma region Modefs
#define retword "-1"
#define MAXCOMB 202020
#define MOD 1000000007
#define EPS 1e-9;
#pragma endregion
//--MACROS---------------------------------
#pragma region Macros
#include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define RSORT(x) sort((x).rbegin(), (x).rend())
#define ALL(x) (x).begin(), (x).end()
#define REV(x) reverse(ALL(x))
#define rep(i, n) for (ll i = 0; i < n; i++)
#define reps(i, m, n) for (ll i = m; i < n; i++)
#define repr(i, m, n) for (ll i = m; i >= n; i--)
#define SP << " " <<
#define INF2 1000000000000000037LL
#define INF  1000000007
#define lwb(x,n) distance(x.begin(),lower_bound(ALL(x),(n)))
#define upb(x,n) distance(x.begin(),upper_bound(ALL(x),(n)))
#define fora(i, ...) if(ll i = -1) for(__VA_ARGS__) if(i++, true)
#ifdef _MY_DEBUG
#define isdebug true
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug_4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl
#define de(...) CHOOSE((__VA_ARGS__,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)
#else
#define isdebug false
#define de(...)
#endif
using namespace std;
using ll = long long;
using ld = long double;
const ld PI = 3.141592653589793238462643;
using P  = pair<ll,ll>;
using TP  = tuple<ll,ll,ll>;
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
template<class T = ll> using v = vector<T>;
template<class T = ll> using vv = vector<vector<T>>;
template<class T = ll> using vvv = vector<vector<vector<T>>>;
template<class T> bool maxi(T &a, const T &b){ if(a<b){a=b;return 1;}return 0;}
template<class T> bool mini(T &a, const T &b){ if(b<a){a=b;return 1;}return 0;}
template<class T> ll sumer(const T& a){ return accumulate(ALL(a),0LL); }
template<class T> ll miner(const T& a){ return *min_element(ALL(a)); }
template<class T> ll maxer(const T& a){ return *max_element(ALL(a)); }
template<class T> ll bs(ll ok, ll ng, T checker){
    while( abs(ok-ng)>1 ){ ll mid = (ok+ng)/2; (checker(mid)?ok:ng) = mid; }
    return ok;
}
template<class T> ld bs2(ld ok, ld ng, T checker){
    rep(i,300){ ld mid = (ok+ng)/2; (checker(mid)?ok:ng) = mid; }
    return ok;
}
template<class T> void UNIQUE(vector<T> &a){ SORT(a);a.erase(unique(ALL(a)),a.end());}
template<class T, class U> ostream &operator<<(ostream &os, const pair<T,U> &pe) { os << pe.first << " " << pe.second; return os;}
template<class T> ostream &operator<<(ostream &os, const v<T> &ve) { rep(i,ve.size()) os<< (i?" ":"")<<ve[i]; return os;}
ll topbit(ll a) { return a==0?-1:63-__builtin_clzll(a);}
ll botbit(ll a) { return a==0?64:__builtin_ctzll(a);}
ll popcount(ll a) { return __builtin_popcountll(a);}
#define dame do {cout<< retword <<"\n"; return;} while(false)
template< int mod >
struct ModInt {
    ll x;
    ModInt() : x(0) {}
    ModInt(ll y) : x(y >= 0 ? ( y<mod ? y : y%mod ) : (mod - (-y) % mod) % mod) {}
    ModInt &operator+=(const ModInt &p) {
        if((x += p.x) >= mod) x -= mod;
        return *this;
    }
    ModInt &operator-=(const ModInt &p) {
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }
    ModInt &operator*=(const ModInt &p) {
        x = (int) (1LL * x * p.x % mod);
        return *this;
    }
    ModInt &operator/=(const ModInt &p) {
        *this *= p.inv();
        return *this;
    }
    ModInt operator-() const { return ModInt(-x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }
    bool operator<(const ModInt &p) const {return x < p.x; }

    ModInt operator+(const ll &q) const {return ModInt(*this) += (ModInt)q; }
    ModInt operator-(const ll &q) const {return ModInt(*this) -= (ModInt)q; }
    ModInt operator*(const ll &q) const {return ModInt(*this) *= (ModInt)q; }
    ModInt operator/(const ll &q) const {return ModInt(*this) /= (ModInt)q; }
    bool operator==(const ll &q) const {return x == q; }
    bool operator!=(const ll &q) const {return x != q; }

    ModInt operator++(){ if(++x == mod) x = 0; return *this; }
    ModInt operator--(){ x = (x == 0 ? mod-1 : x-1); return *this; }
    ModInt operator++(int){ const ModInt res(*this); ++*this; return res; }
    ModInt operator--(int){ const ModInt res(*this); --*this; return res; }

    ModInt inv() const {
        int a = x, b = mod, u = 1, v = 0, t;
        while(b > 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
        }
        return ModInt(u);
    }

    ModInt pow(ll n, bool inv=false) const {
        ModInt ret(1), mul(x);
        while(n > 0) {
        if(n & 1) ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        if(inv) ret=ret.inv();
        return ret;
    }

    friend ostream &operator<<(ostream &os, const ModInt &p) {
        return os << p.x;
    }
    friend istream &operator>>(istream &is, ModInt &a) {
        ll t;
        is >> t;
        a = ModInt< mod >(t);
        return (is);
    }
};
using mint = ModInt< MOD >;
mint mpow(ll x, ll n, bool inv=false) {
    mint ret(1), mul(x);
    while(n > 0) {
    if(n & 1) ret *= mul;
        mul *= mul;
        n >>= 1;
    }
    if(inv) ret=ret.inv();
    return ret;
}
mint fac[MAXCOMB], finv[MAXCOMB], inv[MAXCOMB];
void cinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    reps(i, 2, MAXCOMB){
        fac[i] = fac[i - 1] * i;
        inv[i] = inv[MOD%i] * -(MOD/i);
        finv[i] = finv[i - 1] * inv[i];
    }
}
mint com(int n, int k){ // 二項係数計算
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * finv[k] * finv[n-k];
}
#pragma endregion
//--GLOBAL---------------------------------
ll N,M;
template<class Hono, class Nono>
struct graph{
    struct edge{ll to;};
    ll N;
    Hono unithead;
    vector<vector<edge> > G;
    vector<ll> par;
    vector<Hono> toparhead, fromparhead;
    vector<vector<Hono>> lsumhead, rsumhead;
    vector<Nono> nodepara;
    ll root=-1;
    bool debugmode=false;

    graph(ll n) : N(n), unithead(Hono()), G(N), par(N,-1), toparhead(N, unithead), fromparhead(N, unithead), lsumhead(N), rsumhead(N), nodepara(N) {}

    void ade(ll s, ll t){
        G[s].emplace_back((edge){t});
        G[t].emplace_back((edge){s}); //無向ならON
    }

    void dfs1(ll v, ll p=-1){
        par[v]=p;
        Hono suml=unithead, sumr=unithead;
        ll neigh=G[v].size();
        lsumhead[v].resize(neigh+1), rsumhead[v].resize(neigh+1);
        lsumhead[v][0]=rsumhead[v][neigh]=unithead;
        rep(i,neigh){
            auto E = G[v][i];
            if(E.to!=par[v]){
                dfs1(E.to,v);
                suml=mergehead(suml,toparhead[E.to]);
            }
            lsumhead[v][i+1]=suml;
        }
        repr(i,neigh-1,0){
            auto E = G[v][i];
            if(E.to!=par[v]) {
                sumr=mergehead(sumr,toparhead[E.to]);
            }
            rsumhead[v][i]=sumr;
        }
        toparhead[v]=throughnode(sumr,nodepara[v]);
        if(debugmode){
            cout<< v <<" -> "<< p <<endl;
            debugout(sumr);
            debugout(toparhead[v]);
            cout<<endl;
        }
    }

    void dfs2(ll v){
        rep(i, G[v].size()){
            auto E = G[v][i];
            if(E.to==par[v]) continue;
            Hono lackhead=mergehead(fromparhead[v], mergehead(lsumhead[v][i],rsumhead[v][i+1]));
            fromparhead[E.to]=throughnode(lackhead,nodepara[v]);
            if(debugmode){
                cout<< v <<" -> "<< E.to <<endl;
                debugout(lackhead);
                debugout(fromparhead[E.to]);
                cout<<endl;
            }
            dfs2(E.to);
        }
    }

    void calcnode(){
        rep(v,N){
            // nodepara[v], (ll)G[v].size
            ll ans=1;
            rep(i,G[v].size()){
                auto E = G[v][i];
                Hono head=( E.to==par[v] ? fromparhead[v] : toparhead[E.to] );
                if(head.nodesu==0) continue;
                (ans*=head.kuro)%=M;
            } 
            cout<< ans <<"\n";
        }
    }

    void calcedge(){
        rep(v,N){
            if(v==root) continue;
            Hono head1=toparhead[v], head2=fromparhead[v];

        }
    }

    void build(ll _root=0){
        root=_root;
        dfs1(root);
        dfs2(root);
        calcnode(); // refer to nodepara and edge-partial trees attached to it (for node query)
        calcedge(); // refer to edgepara and node-partial trees attached to it (for path)
    }

    void debug(){
       if(isdebug) debugmode=true;
    }
    void debugout(Hono &head){
        de(head.kuro);
    }
};

struct HONO{
    ll kuro=0;
    ll edgesu=0;
    ll nodesu=0;
};
struct NONO{
    ll val=0;
};
HONO mergehead(HONO head1, HONO head2) { // 下にある(siro+kuro)をかける
    if(head1.nodesu==0) return head2;
    if(head2.nodesu==0) return head1;
    HONO head;
    head.edgesu=head1.edgesu+head2.edgesu;
    head.nodesu=head1.nodesu+head2.nodesu;
    head.kuro=head1.kuro*head2.kuro%M;
    return head;
}
HONO throughnode(HONO head1, NONO node1){
    HONO head=head1;
    if(head1.nodesu==0){ //葉の初期化
        head.kuro=2;
    }
    else{
        head.kuro+=1;
    }
    head.edgesu=1;
    head.nodesu=head1.nodesu+1;
    return head;
}
//--MAIN-----------------------------------
void Main(){
    cin>>N>>M;
    graph<HONO,NONO> g(N);
    rep(i,N-1){
        ll a,b; cin>>a>>b; --a,--b;
        g.ade(a,b);
    }
    // g.debug();
    g.build();
}
//--START----------------------------------
int main() {
    cin.tie(nullptr); ios_base::sync_with_stdio(false);
    // if(isdebug) {ifstream in("input.txt"); cin.rdbuf(in.rdbuf());}
    // if(isdebug) {ofstream out("output.txt"); cout.rdbuf(out.rdbuf());}
    cout << fixed << setprecision(15);
    // ll Qkai; cin>>Qkai; rep(QQ,Qkai) Main();
    Main();
}
//-----------------------------------------

Measured memory_bytes: 47104