// Marcin Knapik
#include<bits/stdc++.h>

#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

using namespace std;

//#include <ext/pb_ds/assoc_container.hpp> // order_of_key
//#include <ext/pb_ds/tree_policy.hpp> // find by order
//using namespace __gnu_pbds; 
//#define ordered_set tree< int , null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>  

// const ll MAX_LL = 0xFFFFFFFFFFFFFFFF;
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define losuj(a, b) uniform_int_distribution<ull>(a, b)(rng)
#define losuj_real(a, b) uniform_real_distribution<long double>(a, b)(rng)

typedef long double             ld;
typedef long long               ll;
typedef unsigned long long      ull;
typedef pair<ll, ll>            pll;
typedef pair<int, int>          ii;
typedef vector<int>             vi;
typedef vector<ii>              vii;
typedef vector<vi>              vvi;
typedef vector<vector<ii>>      vvii;
typedef vector< ll >            vll;
typedef vector< pll >           vpll;
 
#define sz(a)                   (int)(a).size()
#define pb                      push_back
#define all(c)                  (c).begin(), (c).end()
#define rall(c)                 (c).rbegin(), (c).rend()
#define FOR(i, a)               for (int i = 0; i < (a); i++)
#define f                       first
#define s                       second
#define rr "\e[31m "
#define bb "\e[m "

template <class T> inline bool setmin(T &a, T b){if (a > b)return a = b, 1;return 0;}
template <class T> inline bool setmax(T &a, T b){if (a < b)return a = b, 1;return 0;}
 
template<class T> inline  T fast(T a,T b,T mod) {ll res = 1; while(b){if(b&1) res = (res*a)%mod;a = (a*a)%mod;b >>= 1;}return res;}
template<class T> inline  T russian(T a, T b, T mod) {ll res = 0; while(b){if(b&1) res = (res + a)%mod; a = (a+a)%mod; b>>=1;}return res;}
template<class T> istream &operator>>(istream &os, vector<T> &container){for (auto &u : container)os >> u;return os;}
template<class T> ostream &operator<<(ostream &os, const vector<T> &container){for (auto &u : container)os << u << " ";return os;}
template<class T> inline  T gcd(T a, T b) { while (b)swap(a %= b, b); return a; }

const ll INF = 1e9 + 7;
const ll mod = 998244353;
const ll N = 1e6+7;
const ll T = 1<<20;
const ll BIG_INF = 1e18 + 7;

ll n, m;

ll dp[N];
ll ans[N];
vector<ll> pref[N];
vector<ll> suf[N];

vvi G(N);

void dfs(int x, int pre = -1){
	dp[x] = 1;

	pref[x].resize(sz(G[x]) + 1);
	pref[x][0] = 1;
	suf[x].resize(sz(G[x]) + 1);
	suf[x].back() = 1;

	for(int i = 0; i < sz(G[x]); i++)
		if(G[x][i] != pre){
			dfs(G[x][i], x);
			(dp[x] *= dp[G[x][i]]) %= m;
			pref[x][i + 1] = pref[x][i] * dp[G[x][i]] % m;
		}
		else
			pref[x][i + 1] = pref[x][i];

	for(int i = sz(G[x]) - 1; i >= 0; i--)
		if(G[x][i] != pre)
			suf[x][i] = suf[x][i+1] * dp[G[x][i]] % m;
		else
			suf[x][i] = suf[x][i+1]; 
	(dp[x] += 1) %= m;
}

void dfs2(int x, int pre = -1, ll z_gory = 1){
	ans[x] = (suf[x][0]) * z_gory % m;

	for(int i = 0; i < sz(G[x]); i++)
		if(G[x][i] != pre)
			dfs2(G[x][i], x, ((z_gory * suf[x][i+1] % m) * pref[x][i] + 1) % m);
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);	
	
	cin >> n >> m;
	FOR(i, n-1){
		int a, b;
		cin >> a >> b;

		G[a].pb(b);
		G[b].pb(a);
	}

	dfs(1);
	// exit(0);
	dfs2(1);

	for(int i = 1; i <= n; i++)
		cout << ans[i] << ' ';
	cout << '\n';
}	


Measured memory_bytes: 95360