#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#define MOD 1000000007
#define MOD2 998244353
#define int long long
#define double long double
#define EPS 1e-9
//#define PI 3.14159265358979

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;

template < typename T >
ostream &operator<<(ostream &os, const vector< T > &A) {
	for (int i = 0; i < A.size(); i++)
		os << A[i] << " ";
	os << endl;
	return os;
}
template <>
ostream &operator<<(ostream &os, const vector< vector< int > > &A) {
	int N = A.size();
	int M;
	if (N > 0)
		M = A[0].size();
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < M; j++)
			os << A[i][j] << " ";
		os << endl;
	}
	return os;
}

typedef pair< int, int > pii;
typedef long long ll;

struct edge {
	int from, to, d, c;
	edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
		from = _from;
		to = _to;
		d = _d;
		c = _c;
	}
	bool operator<(const edge &rhs) const {
		return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
	}
};
struct aabb {
	int x1, y1, x2, y2;
	aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};

typedef vector< edge > edges;
typedef vector< edges > graph;
struct flow {
	int to, cap, rev, cost;
	flow(int to = 0, int cap = 0, int rev = 0, int cost = 0) : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector< vector< flow > > flows;

const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);

int pow2(int n) { return 1LL << n; }
template < typename T, typename U >
bool chmin(T &x, const U &y) {
	if (x > y) {
		x = y;
		return true;
	}
	return false;
}
template < typename T, typename U >
bool chmax(T &x, const U &y) {
	if (x < y) {
		x = y;
		return true;
	}
	return false;
}

struct initializer {
	initializer() {
		cout << fixed << setprecision(20);
	}
};
initializer _____;

int N, M, K, T, Q, H, W;
int dfs(vector< vector< int > > &G, vector< map< int, int > > &dp, vector< vector< int > > &l, vector< vector< int > > &r, int x, int p, int f) {
	if (dp[x].count(p))
		return dp[x][p];
	int tmp = 1;
	vector< int > ress;
	if (p == -1 || f) {
		for (auto j : G[x]) {
			if (j == p)
				continue;
			int tmp2 = dfs(G, dp, l, r, j, x, f);
			(tmp *= tmp2) %= M;
			if (p == -1)
				ress.push_back(tmp2);
		}
		if (p == -1) {
			int K = ress.size();
			l[x].resize(K + 1, 1);
			r[x].resize(K + 1, 1);
			rep(i, K) l[x][i + 1] = l[x][i] * ress[i] % M;
			rep(i, K) r[x][K - 1 - i] = r[x][K - i] * ress[K - 1 - i] % M;
		}
	} else {
		dfs(G, dp, l, r, x, -1, f);
		int k = lower_bound(G[x].begin(), G[x].end(), p) - G[x].begin();
		tmp = l[x][k] * r[x][k + 1] % M;
	}
	return dp[x][p] = (tmp + 1) % M;
}
signed main() {
	cin >> N >> M;
	vector< vector< int > > G(N);
	rep(i, N - 1) {
		int a, b;
		cin >> a >> b;
		--a;
		--b;
		G[a].push_back(b);
		G[b].push_back(a);
	}
	rep(i, N) sort(G[i].begin(), G[i].end());
	vector< vector< int > > l(N), r(N);
	vector< map< int, int > > dp(N);
	dfs(G, dp, l, r, 0, -1, 1);
	rep(v, N) cout << (dfs(G, dp, l, r, v, -1, 0) - 1 + M) % M << endl;
	return 0;
}

Measured memory_bytes: 59264