#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)




#ifdef _MSC_VER
#include <intrin.h>

#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif

#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>



using namespace std;
//using namespace atcoder;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << endl
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
//#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << " \n"[i==(int)v.size()-1]
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;

int mod = 1000000007;
// const int mod = 998244353;
struct mint {
	ll x; // typedef long long ll;
	mint(ll x = 0) :x((x%mod + mod) % mod) {}
	mint operator-() const { return mint(-x); }
	mint& operator+=(const mint a) {
		if ((x += a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint a) {
		if ((x += mod - a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this; }
	mint operator+(const mint a) const { return mint(*this) += a; }
	mint operator-(const mint a) const { return mint(*this) -= a; }
	mint operator*(const mint a) const { return mint(*this) *= a; }
	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime mod
	mint inv() const { return pow(mod - 2); }
	mint& operator/=(const mint a) { return *this *= a.inv(); }
	mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }

template<typename T>
struct ReRooting {
	int N;
	vector<vector<int>>adj, idxForAdj;
	vector<T>res;
	vector<vector<T>>dp;
	T identity;
	function<T(T, T)>ope;
	function<T(T, int)>opeNode;
	ReRooting(int N, vector<vector<int>>edges, T identity, function<T(T, T)>ope, function<T(T, int)>opeNode) :N(N), identity(identity), ope(ope), opeNode(opeNode),adj(N),idxForAdj(N),dp(N),res(N){
		for (int i = 0; i < edges.size(); i++) {
			auto &edge = edges[i];
			idxForAdj[edge[0]].push_back(adj[edge[1]].size());
			idxForAdj[edge[1]].push_back(adj[edge[0]].size());
			adj[edge[0]].push_back(edge[1]);
			adj[edge[1]].push_back(edge[0]);
		}
		for (int i = 0; i < adj.size(); i++)dp[i] = vector<T>(adj[i].size());
		if (N > 1)initialize();
		else if (N == 1)res[0] = opeNode(identity, 0);
	}
	void initialize() {
		vector<int>par(N);
		vector<int>ord(N);
#pragma region InitOrderedTree
		int idx = 0;
		stack<int>stk;
		stk.push(0);
		par[0] = -1;
		while (!stk.empty()) {
			auto node = stk.top();
			stk.pop();
			ord[idx++] = node;
			for (auto nxt : adj[node]) {
				if (nxt == par[node])continue;
				stk.push(nxt);
				par[nxt] = node;
			}
		}
#pragma endregion

#pragma region fromLeaf
		for (int i = ord.size() - 1; i >= 1; i--) {
			auto node = ord[i];
			auto parent = par[node];
			T accum = identity;
			int parIdx = -1;
			for (int j = 0; j < adj[node].size(); j++) {
				if (adj[node][j] == parent) {
					parIdx = j;
					continue;
				}
				accum = ope(accum, dp[node][j]);
			}

			dp[parent][idxForAdj[node][parIdx]] = opeNode(accum, node);
		}
#pragma endregion

#pragma region toLeaf
		for (int i = 0; i < ord.size(); i++) {
			auto node = ord[i];
			T accum = identity;
			vector<T>accumsFromTail(adj[node].size());
			accumsFromTail[accumsFromTail.size() - 1] = identity;
			for (int j = accumsFromTail.size() - 1; j >= 1; j--)accumsFromTail[j - 1] = ope(dp[node][j], accumsFromTail[j]);
			for (int j = 0; j < accumsFromTail.size(); j++) {
				dp[adj[node][j]][idxForAdj[node][j]] = opeNode(ope(accum, accumsFromTail[j]), node);
				accum = ope(accum, dp[node][j]);
			}
			res[node] = opeNode(accum, node);
		}
#pragma endregion
	}
};

mint mul(mint a, mint b) { return a * b; }
mint f(mint val, int id) { return val + 1; }
void solve() {
	int N; cin >> N;
	int M; cin >> M;
	mod = M;
	vector<vector<int>>edges;
	function<mint(mint, mint)>ope = mul;
	function<mint(mint, int)>opeNode = f;
	REP(i, N - 1) {
		int u, v; cin >> u >> v;
		u--, v--;
		edges.push_back({ u,v });
	}
	ReRooting<mint> R(N, edges, 1, ope, opeNode);
	REP(i, N)print((mint)(R.res[i]-1));
}



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	//int q;
	//cin >> q;
	//while (q--)
	solve();

}


Measured memory_bytes: 36744