#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

long long int MOD = 0;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

ll func(vvl &G, vl &DP, ll s, ll p) {
  ll ans = 1;
  AUTO(g, G[s]) {
    if (g == p)
      continue;
    ans *= (func(G, DP, g, s) + 1) % MOD;
    ans %= MOD;
  }
  return DP[s] = ans;
}

void func2(vvl &G, vl &DP, vl &DP2, ll s, ll p) {
  DP2[s] = 1;
  AUTO(g, G[s]) {
    DP2[s] *= (DP[g] + 1) % MOD;
    DP2[s] %= MOD;
  }

  ll n = G[s].size();
  vl lft(n), rht(n);
  REP(i, n) {
    lft[i] = (DP[G[s][i]] + 1) % MOD;
    rht[i] = (DP[G[s][i]] + 1) % MOD;
  }
  FOR(i, 1, n) {
    lft[i] *= lft[i - 1];
    lft[i] %= MOD;
  }
  RREP(i, n - 1) {
    rht[i] *= rht[i + 1];
    rht[i] %= MOD;
  }

  REP(i, n) if (G[s][i] != p) {
    DP[s] = 1;
    if (i > 0)
      DP[s] *= lft[i - 1];
    if (i + 1 < n)
      DP[s] *= rht[i + 1];
    DP[s] %= MOD;
    // 自分の子を呼ぶたびにDP[s]を変えてるのが味噌of味噌
    func2(G, DP, DP2, G[s][i], s);
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N;
  cin >> N >> MOD;
  vvl G(N);
  vl DP(N, 0);

  REP(i, N - 1) {
    ll x, y;
    cin >> x >> y;
    x--;
    y--;
    G[x].push_back(y);
    G[y].push_back(x);
  }
  func(G, DP, 0, -1);
  vl DP2(N, 0);

  func2(G, DP, DP2, 0, -1);
  REP(d, N) cout << DP2[d] << endl;

  return 0;
}


Measured memory_bytes: 20864