// Vivek Rai
// Blazer_007

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/detail/standard_policies.hpp>

#define fastio 		ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define mp	         make_pair
#define inf         0x3f3f3f3f
//#define INF         0x3f3f3f3f3f3f3f3fLL
#define ll          long long
#define pb          push_back
#define pii         pair<ll,ll>
#define vi          vector<ll>
#define vii         vector<pii>
#define mi          map<ll,ll>
#define mii         map<pii,ll>
#define ppi	        pair<ll,pii>
#define all(a)      (a).begin(),(a).end()
#define FF           first
#define SS           second
#define sz(x)       (int)x.size()
#define endl        '\n'
#define hell        1000000007
#define see(x)	    cout<<x<<endl;
#define see2(x,y)   cout<<x<<" "<<y<<endl;
#define see3(x,y,z) cout<<x<<" "<<y<<" "<<z<<endl;
#define bit(x, y)   (((x)>>(y))&1)
#define bpt(x)      (__builtin_popcount(x))
#define bptl(x)     (__builtin_popcountll(x))
#define loop(i,a,b)  for(int i=a;i<b;i++)
#define rloop(i,a,b) for(int i=a;i>=b;i--)
#define N 2000010

using namespace std;
//using namespace __gnu_pbds;

//typedef priority_queue<int> maxHeap;
//typedef priority_queue<int,vector<int>,greater<int>()) minHeap;
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
// find_by_order(index) -> value at given index or Kth smallest element in set
// order_of_key(X) -> number of elements strictly less than X
//typedef tree<pii , null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> OST;

#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
    template <typename Arg1>
    void __f(const char* name, Arg1&& arg1){
        cout << name << " : " << arg1 << endl;
        //use cerr if u want to display at the bottom
    }
    template <typename Arg1, typename... Args>
    void __f(const char* names, Arg1&& arg1, Args&&... args){
        const char* comma = strchr(names + 1, ','); cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
    }
#else
#define trace(...)
#endif

vector<int> tree[100001];
ll dp1[100001],dp2[100001];


void solve2(int src, bool vis[], int m, ll par_ans){
    vis[src] = 1;
    dp2[src] = ((1 + par_ans) * dp1[src] )% m;
    vi prefix,suffix;
    for(int child: tree[src]){
        if(!vis[child]){
            prefix.pb(1 + dp1[child]);
            suffix.pb(1 + dp1[child]);
        }
    }
    // reverse(all(suffix));
    rloop(i,sz(suffix)-2,0){
        suffix[i] = (suffix[i] * suffix[i+1]) % m;
    }
    loop(i,1,sz(prefix)){
        prefix[i] = (prefix[i] * prefix[i-1]) % m;
    }
    int cno = 0;
    for(int child: tree[src]){
        if(!vis[child]){
            ll ways = (1 + par_ans);
            ways = (cno > 0) ? (ways * prefix[cno - 1]) % m : ways ;
            ways = (cno < sz(suffix) - 1) ? (ways * suffix[cno + 1]) % m : ways ;
            solve2(child, vis, m, ways);
            cno++;
        }
    }
}

void solve1(int src, bool vis[], int m){
    vis[src] = 1;
    dp1[src] = 1;
    for(int child:tree[src]){
        if(!vis[child]){
            solve1(child,vis,m);
            dp1[src] = (dp1[src] * (1 + dp1[child])) % m ;
        }
    }
}

void solution(){
    int n,m,u,v;
    cin >> n >> m;
    loop(i,0,n-1){
        cin >> u >> v;
        tree[u].pb(v);
        tree[v].pb(u);
    }
    bool vis[n+1];
    memset(vis,0,sizeof vis);
    solve1(1, vis, m);
    memset(vis,0,sizeof vis);
    solve2(1,vis,m,0);
    loop(i,1,n+1)
        cout << dp2[i] << endl;
}

signed main(){
    fastio
    ll t=1;
    // cin>>t;
    loop(i,1,t+1){
    	//cout<<"Case #"<<i<<": ";
    	solution();
    }
}




Measured memory_bytes: 26496