/*
 _____ _             _              _           _
|_   _| |__   ___   / \   _ __  ___| |__  _   _| |
  | | | '_ \ / _ \ / _ \ | '_ \/ __| '_ \| | | | |
  | | | | | |  __// ___ \| | | \__ \ | | | |_| | |
  |_| |_| |_|\___/_/   \_\_| |_|___/_| |_|\__,_|_|

*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll          long long
#define pb          push_back
#define ppb         pop_back
#define	endl		'\n'
#define mii         map<ll,ll>
#define msi         map<string,ll>
#define mis         map<ll, string>
#define rep(i,a,b)    for(ll i=a;i<b;i++)
#define repr(i,a,b) for(ll i=b-1;i>=a;i--)
#define trav(a, x) 	for(auto& a : x)
#define pii         pair<ll,ll>
#define vi          vector<ll>
#define vii         vector<pair<ll, ll>>
#define vs          vector<string>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define sz(x)       (ll)x.size()
#define hell        1000000007
#define lbnd        lower_bound
#define ubnd        upper_bound
#define max(a,b)	(a>b?a:b)
#define min(a,b)	(a<b?a:b)

/*	For Debugging	*/
#define DEBUG 		cerr<<"\n>>>I'm Here<<<\n"<<endl;
#define display(x) trav(a,x) cout<<a<<" ";cout<<endl;
#define what_is(x)  cerr << #x << " is " << x << endl;

std::mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count());
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define TIME        cerr << "\nTime elapsed: " << setprecision(5) <<1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
#define DECIMAL(n)  cout << fixed ; cout << setprecision(n);
#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace __gnu_pbds;
using namespace std;
#define PI 3.141592653589793
#define N  100005
ll n,m;
vi a[N];
ll dp1[N],dp2[N];

void dfs(ll node,ll pr)
{
	dp1[node]=1;
	for(auto i:a[node])
	{
		if(i!=pr)
		{
			dfs(i,node);
			dp1[node]=(dp1[node]*(dp1[i]+1))%m;
		}
	}
	return;
}
void dfs1(ll node,ll pr,ll pre)
{
	vi v1,v2;

	v1.pb(1);
	for(auto i:a[node])
	{
		if(i==pr)
		{
			v1.pb(1);
			v2.pb(1);
		}
		else
		{
			v1.pb(dp1[i]+1);
			v2.pb(dp1[i]+1);
		}
	}
	v2.pb(1);

	ll temp_n=sz(a[node]);

	rep(i,1,temp_n+1)
	v1[i]=(v1[i]*v1[i-1])%m;

	repr(i,0,temp_n)
	v2[i]=(v2[i]*v2[i+1])%m;

	ll num;
	rep(i,0,temp_n)
	{
		if(a[node][i]==pr)
			continue;

		num=(v1[i]*v2[i+1])%m;

		dfs1(a[node][i],node,(num*(pre+1))%m);
	}
	dp2[node]=(v1[temp_n]*(pre+1))%m;
	return;
}

void solve()
{
	cin>>n>>m;
	ll x,y;
	rep(i,1,n)
	{
		cin>>x>>y;
		a[x].pb(y);
		a[y].pb(x);
	}
	dfs(1,-1);
	dfs1(1,-1,0);
	rep(i,1,n+1)
	{
		cout<<dp2[i]<<"\n";
	}
	return;
}
int main()
{
	FAST
	int TESTS=1;
//	cin>>TESTS;
	while(TESTS--)
	{
		solve();
	}
	TIME
	return 0;
}