#include <bits/stdc++.h>
#define endl '\n'
#define pb push_back
#define mp make_pair
#define LL long long
#define INF 0x3f3f3f3f
#define Inf 1000000000000000000LL
#define F first
#define S second
using namespace std;
typedef pair<int,int>pii;
int m,n,ans[100050],pre[100050],suf[100050],dp[100050];
vector<int>ve[100050];
void dfs(int u,int fa){
	int lim=ve[u].size(),y;
	dp[u]=1;
	for(int i=0;i<lim;i++)if((y=ve[u][i])!=fa){
		dfs(y,u);
		pre[y]=dp[u];
		dp[u]=(dp[y]+1)*1ll*dp[u]%m;
	}
	int k=1;
	for(int i=lim-1;i>=0;i--)if((y=ve[u][i])!=fa){
		suf[y]=k;
		k=(dp[y]+1)*1ll*k%m;
	}
}
void get_ans(int u,int fa,int t){
	ans[u]=(t+1)*1ll*dp[u]%m;
	int lim=ve[u].size(),y;
	for(int i=0;i<lim;i++)
		if((y=ve[u][i])!=fa)
			get_ans(y,u,(t+1)*1ll*pre[y]%m*suf[y]%m);
}
int main(){
	int u,v;
	cin>>n>>m;
	for(int i=1;i<n;i++){
		cin>>u>>v;
		ve[u].pb(v);
		ve[v].pb(u);
	}
	dfs(1,0),get_ans(1,0,0);
	for(int i=1;i<=n;i++)cout<<ans[i]<<endl;
}
