#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
using namespace std;
///////////////////library zone!!!!!!!!!!!!!!!!!!!!!!!!!!!!
typedef long long ll;
typedef long double ld;
#define all(a) (a).begin(),(a).end()
#define EPS (1e-5)
#define bit(n,k) ((n>>k)&1)
const ll Mod = 1000000007;
const ll mod = 998244353;
struct H {
	ll x, y;
	bool operator<(const H &b) const {
		if (x != b.x) return x < b.x;
		return y < b.y;
	}
	bool operator>(const H &b) const {
		if (x != b.x) return x > b.x;
		return y > b.y;
	}
	bool operator==(const H &b) const { return x == b.x&&y == b.y; }
	bool operator!=(const H &b) const { return (*this) != b; }
};
struct P {
	ll pos, cost;
	bool operator<(const P &b) const { return cost < b.cost; }
	bool operator>(const P &b) const { return cost > b.cost; }
};
struct B {
	ll to, cost;
};
struct E {
	ll from, to, cost;
	bool operator<(const E &b) const { return cost < b.cost; }
	bool operator>(const E &b) const { return cost > b.cost; }
};
template<typename T, typename U>
void chmin(T &a, U b) {
	if (a > b) a = b;
}
template<typename T, typename U>
void chmax(T &a, U b) {
	if (a < b) a = b;
}
template<typename T>
T max_0(T a) {
	if (a < 0) return 0;
	return a;
}
template<typename T>
T min_0(T a) {
	if (a > 0) return 0;
	return a;
}
ll read() {
	ll u;
	ll k = scanf("%lld", &u);
	return u;
}
ll gcd(ll i, ll j) {
	if (i > j) swap(i, j);
	if (i == 0) return j;
	return gcd(j%i, i);
}
ll mod_pow(ll x, ll n, ll p) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x % p;
		x = x * x % p;
		n >>= 1;
	}
	return res;
}//x^n%p
vector<string>split(string s, char c = ' ') {
	vector<string>vec;
	string h = "";
	for (int i = 0; i < s.size();) {
		int j = i;
		while (j < s.size() && s[j] != ' ') {
			h += s[j++];
		}
		if (h.size() > 0) vec.push_back(h);
		h = "";
		i = j + 1;
	}
	return vec;
}
const ll Inf = 3023372036854775807;
const int inf = 1500000000;
#define int long long
//----------------------------------------------------
int n, m;
vector<int>e[200000];

int dp[200000];
//頂点iが根の部分木で、iが黒である通り数はいくつ？
vector<int>b[200000];
vector<int>c[200000];
int solve(int t, int r) {
	if (dp[t] > 0) return dp[t];
	int sum = 1;
	for (int i = 0; i < e[t].size(); i++) {
		if (e[t][i] == r) continue;
		sum *= solve(e[t][i], t) + 1;
		sum %= m;
	}
	return dp[t] = sum;
}
void solve2(int t, int r, int k) {
	int sum = 1;
	for (int i = 0; i < e[t].size(); i++) {
		if (e[t][i] == r) {
			int res = (k == 0 ? 1 : b[r][k - 1]);
			res *= (k == (int)c[r].size() - 1 ? 1 : c[r][k + 1]);
			res %= m;
			b[t].push_back(res + 1);
			c[t].push_back(res + 1);
		}
		else {
			b[t].push_back(dp[e[t][i]] + 1);
			c[t].push_back(dp[e[t][i]] + 1);
		}
		sum *= b[t][i];
		sum %= m;
	}
	for (int i = 1; i < e[t].size(); i++) {
		b[t][i] = b[t][i - 1] * b[t][i] % m;
	}
	for (int i = (int)e[t].size() - 2; i >= 0; i--) {
		c[t][i] = c[t][i] * c[t][i + 1] % m;
	}
	for (int i = 0; i < e[t].size(); i++) {
		if (e[t][i] != r) solve2(e[t][i], t, i);
	}
	dp[t] = sum;
}
signed main() {
	cin >> n >> m;
	for (int i = 1; i < n; i++) {
		int u, v;
		cin >> u >> v;
		e[u].push_back(v);
		e[v].push_back(u);
	}
	solve(1, 0);
	solve2(1, 0, 0);
	for (int i = 1; i <= n; i++) 
		cout << dp[i] << endl;
}

Measured memory_bytes: 36736