#pragma region Macros
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define rep2(i,a,b) for(ll i=a;i<=b;++i)
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep3(i,a,b) for(ll i=a;i>=b;i--)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define vec vector<int>
#define vecll vector<ll>
#define vecpii vector<pii>
#define vec2(a,b) vector<vec>(a,vec(b))
#define vec2ll(a,b) vector<vecll>(a,vecll(b))
#define vec3(a,b,c) vector<vector<vec>>(a,vec2(b,c))
#define vec3ll(a,b,c) vector<vector<vecll>>(a,vec2ll(b,c))
#define fi first
#define se second
#define endl "\n"
#define all(c) begin(c),end(c)
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),(x)))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),(x)))
using namespace std;
int in() {int x;cin>>x;return x;}
ll lin() {ll x;cin>>x;return x;}
string stin() {string s;cin>>s;return s;}
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
void print(){putchar(' ');}
void print(bool a){cout<<a;}
void print(int a){cout<<a;}
void print(long long a){cout<<a;}
void print(char a){cout<<a;}
void print(string &a){cout<<a;}
void print(double a){cout<<a;}
template<class T> void print(const vector<T>&);
template<class T, size_t size> void print(const array<T, size>&);
template<class T, class L> void print(const pair<T, L>& p);
template<class T, size_t size> void print(const T (&)[size]);
template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout<<" "; print(*i); } }
template<class T> void print(const set<T>& a){ if(a.empty()) return; print(*a.begin()); for(auto i = a.begin(); ++i != a.end(); ){ cout<<" "; print(*i); } }
template<class T> void print(const multiset<T>& a){ if(a.empty()) return; print(*a.begin()); for(auto i = a.begin(); ++i != a.end(); ){ cout<<" "; print(*i); } }
template<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout<<" "; print(*i); } }
template<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout<<" "; print(*i); } }
template<class T, class L> void print(const pair<T, L>& p){ cout<<'(';print(p.first); cout<<","; print(p.second);cout<<')'; }
template<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ cout<<" "; print(*i); } }
template<class T> void print(const T& a){ cout << a; }
template<class T> ostream& operator<<(ostream& os, vector<T> a){print(a);return os;}
template<class T> ostream& operator<<(ostream& os, set<T> a){print(a);return os;}
int out(){ cout<<endl; return 0; }
template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }
ll gcd(ll a, ll b){ while(b){ ll c = b; b = a % b; a = c; } return a; }
ll lcm(ll a, ll b){ if(!a || !b) return 0; return a * b / gcd(a, b); }
#define _GLIBCXX_DEBU
#ifdef _MY_DEBUG
    #undef endl
    #define debug(x) cout<<#x<<": "<<x<<endl
    void err(){}
    template<class T> void err(const T& t){ print(t); cout<<endl; }
    template<class Head, class... Tail> void err(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); }
#else
    #define debug(x)
    template<class... T> void err(const T&...){}
#endif
#pragma endregion






signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);cout<<fixed<<setprecision(15);
    int n=in();
    ll m=lin();
    vector<vec> g(n);
    rep(i,n-1){
        int a=in()-1,b=in()-1;
        g[a].pb(b); g[b].pb(a);
    }
    vecll d(n),ans(n);
    {
        auto dfs = [&](auto &f,int x,int p) -> ll{
            ll ans=1;
            for(auto it = g[x].begin();it!=g[x].end();){
                if(*it == p){it=g[x].erase(it);}
                else ans=(ans*f(f,*it,x))%m, it++;
            }
            return d[x] = (ans+1)%m;
        };
        dfs(dfs,0,-1);
    }
    {
        auto dfs = [&](auto &f,int x,int p,ll k) -> ll{
            ans[x] = k*(d[x]-1+m)%m;
            vecll mem;
            for(auto e:g[x]){mem.pb(d[e]);}
            vecll r{1},l{1};
            rep(i,mem.size())r.eb(r.back()*mem[i]%m);
            rep3(i,mem.size()-1,0)l.eb(l.back()*mem[i]%m);
            reverse(all(l));
            ans[x]=r.back()*k%m;
            rep(i,g[x].size()){
                f(f,g[x][i],x,(k*r[i]%m*l[i+1]%m+1)%m);
            }
        };
        dfs(dfs,0,-1,1);
    }
    cout<<ans<<endl;
}





Measured memory_bytes: 28800