#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))

using namespace std;

using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); return a / gcd(a, b) * b; }
inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> inline T bis(T ok, T ng, function<bool(T)> f, T eps = 1) { while (abs(ok - ng) > eps) { T mi = (ok + ng) / 2; (f(mi) ? ok : ng) = mi; } return ok; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }

template <typename T, typename D>
struct ReRooting {
  using L = function<T(T, D)>;
  using M = function<T(T, T)>;
  struct Edge {
    int to;
    D data;
    Edge(int to, D data) : to(to), data(data) {}
  };
  int n;
  vector<vector<Edge>> edges;
  L lift;
  M merge;
  T e;
  vector<vector<T>> dp;
  vector<int> par;
  vector<T> ans;
  ReRooting(int n, L lift, M merge, T e) : n(n), lift(lift), merge(merge), e(e) {
    edges = vector<vector<Edge>>(n);
  }
  void add_edge(int v, int u, D d) {
    edges[v].emplace_back(u, d);
  }
  T dfs(int v, int p = -1) {
    int l = edges[v].size();
    dp[v] = vector<T>(l);
    T ret = e;
    for (int i = 0; i < l; i++) {
      auto e = edges[v][i];
      if (e.to == p) {
        par[v] = i;
        continue;
      }
      dp[v][i] = lift(dfs(e.to, v), e.data);
      ret = merge(ret, dp[v][i]);
    }
    return ret;
  }
  void bfs(int v, T t) {
    if (par[v] != -1) {
      dp[v][par[v]] = lift(t, edges[v][par[v]].data);
    }
    int l = edges[v].size();
    vector<T> dpl(l + 1, e);
    vector<T> dpr(l + 1, e);
    for (int i = 0; i < l; i++) {
      dpl[i + 1] = merge(dpl[i], dp[v][i]);
    }
    for (int i = l - 1; i >= 0; i--) {
      dpr[i] = merge(dpr[i + 1], dp[v][i]);
    }
    ans[v] = dpr[0];
    for (int i = 0; i < l; i++) {
      if (i == par[v]) continue;
      int u = edges[v][i].to;
      bfs(u, merge(dpl[i], dpr[i + 1]));
    }
  }
  vector<T> solve() {
    dp = vector<vector<T>>(n);
    par = vector<int>(n, -1);
    ans = vector<T>(n);
    dfs(0);
    bfs(0, e);
    return ans;
  }
};

void solve() {
  int N, M;
  cin >> N >> M;
  ReRooting<int, int> root(N,
    [&](int a, int b) { return (a + 1) % M; },
    [&](int a, int b) { return (i64) a * b % M; },
    1);
  rep(i, N - 1) {
    int x, y;
    cin >> x >> y;
    x--, y--;
    root.add_edge(x, y, 0);
    root.add_edge(y, x, 0);
  }
  auto ans = root.solve();
  each(v, ans) cout << v << endl;
}


Measured memory_bytes: 25344