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

using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;

#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define all(a) a.begin(),a.end()
#define println printf("\n");
#define readln(x) getline(cin,x);
#define pb push_back
#define endl "\n"
#define INT_INF 0x3f3f3f3f
#define LL_INF 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007
#define mp make_pair
#define fastio cin.tie(0); cin.sync_with_stdio(0);

#define MAXN 100005

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef unordered_map<int,int> umii;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef pair<int,pii> triple;
typedef int8_t byte;

mt19937 g1(time(0));

int randint(int a, int b){return uniform_int_distribution<int>(a, b)(g1);}
ll randlong(ll a,ll b){return uniform_int_distribution<long long>(a, b)(g1);}

ll gcd(ll a, ll b){return b == 0 ? a : gcd(b, a % b);}
ll lcm(ll a, ll b){return a*b/gcd(a,b);}
ll fpow(ll  b, ll exp, ll mod){if(exp == 0) return 1;ll t = fpow(b,exp/2,mod);if(exp&1) return t*t%mod*b%mod;return t*t%mod;}
ll divmod(ll i, ll j, ll mod){i%=mod,j%=mod;return i*fpow(j,mod-2,mod)%mod;}

int num_nodes,M,cnt,label[MAXN],par[MAXN];
ll og[MAXN],dp[MAXN],ans[MAXN],pref[MAXN],suff[MAXN],v[MAXN];
vector<int> connections[MAXN];
//vector<ll> v[MAXN];

ll dfs(int node, int prev){
	dp[node] = 1;
	for(int check:connections[node]){
		if(check == prev) continue;
		par[check] = node;
		dp[node] = (dp[node]*(dfs(check,node)+1))%M;
	}
	return og[node] = dp[node];
}

ll solve(int node){
	ans[node] = dp[node];
	pref[0] = suff[connections[node].size()+1] = 1;

	for(int i=1; i<=connections[node].size(); i++){
//		int check = connections[node][i-1];
		pref[i] = (pref[i-1]*(dp[connections[node][i-1]]+1))%M;
	}
	for(int i=(int)connections[node].size(); i>=1; i--){
//		int check =
		suff[i] = (suff[i+1]*(dp[connections[node][i-1]]+1))%M;
	}
//	v[node].resize(connections[node].size()+2);
	for(int i=1; i<=connections[node].size(); i++){
//		int check = connections[node][i-1];
		if(!label[connections[node][i-1]]) label[connections[node][i-1]] = ++cnt;
		v[label[connections[node][i-1]]] = (pref[i-1]*suff[i+1])%M;
	}
//		v[node][i] = (pref[i-1]*suff[i+1])%M;
//	ll ov1 = dp[node];
	for(int i=1; i<=connections[node].size(); i++){
//		int check = connections[node][i-1];
		if(connections[node][i-1] == par[node]) continue;
//		ll o_v = dp[check];

//		ll n_v = v[label[connections[node][i-1]]];
		dp[node] = v[label[connections[node][i-1]]];

//		n_v = ((n_v+1)*dp[connections[node][i-1]])%M;
		dp[connections[node][i-1]] = (v[label[connections[node][i-1]]]+1)*dp[connections[node][i-1]]%M;

		solve(connections[node][i-1]);
		dp[connections[node][i-1]] = og[connections[node][i-1]];
		dp[node] = og[node];
	}
}

int main(){
	scanf("%d %d",&num_nodes,&M);
	for(int i=1; i<num_nodes; i++){
		int a,b; scanf(" %d %d",&a,&b);
		connections[a].pb(b);
		connections[b].pb(a);
	}
	dfs(1,-1); solve(1);
	for(int i=1; i<=num_nodes; i++)
		printf("%lld\n",ans[i]);
}

Measured memory_bytes: 16640