#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FOR(i,a,b) for (int i=(a),for_##i##_max=(b);i<=(for_##i##_max);++i)
#define RFOR(i,a,b) for (int i=(a),rfor_##i##_min=(b);i>=(rfor_##i##_min);--i)
#define REP(i,n) for (int i=0,rep_##i##_len=(n);i<(rep_##i##_len);++i)
#define RREP(i,n) for (int i=(n)-1;i>=0;--i)

namespace { // Basics

template<typename T>
void chmin(T &x, T y) {
  x = std::min(x, y);
}

template<typename T>
void chmax(T &x, T y) {
  x = std::max(x, y);
}

template<typename T>
__attribute__((unused))
const auto minimum = static_cast<T const &(*)(T const &, T const &)>(std::min);

template<typename T>
__attribute__((unused))
const auto maximum = static_cast<T const &(*)(T const &, T const &)>(std::max);

template<typename T>
int cmp3(T lhs, T rhs) { return (lhs == rhs) ? 0 : (lhs > rhs) ? 1 : -1; }

template<typename T>
__attribute__((unused))
T constexpr infty = std::numeric_limits<T>::max / 3;
template<>
__attribute__((unused))
auto constexpr infty<int> = 1'100'100'100;
template<>
__attribute__((unused))
auto constexpr infty<long long int> = 100'500'400'300'200'100LL;

using lli = long long int;
using ld = long double;

} // namespace
namespace { // Graph Basics

template<typename WeightT>
struct edge {
  int from, to;
  WeightT weight;
  edge(int s, int d, WeightT w): from(s), to(d), weight(w) {}
};

template<typename WeightT>
bool
operator< (edge<WeightT> const &lhs, edge<WeightT> const &rhs) {
  if (lhs.weight != rhs.weight) {
    return lhs.weight < rhs.weight;
  } else if (lhs.from != rhs.from) {
    return lhs.from < rhs.from;
  }
  return lhs.to < rhs.to;
}

template<typename WeightT>
using edges = std::vector<edge<WeightT> >;

template<typename WeightT>
using adjacency_list = std::vector<edges<WeightT> >;

template<typename WeightT>
void
add_undir_edge(adjacency_list<WeightT> &G, int u, int v, WeightT w) {
  G[u].emplace_back(u, v, w);
  G[v].emplace_back(v, u, w);
}

template<typename WeightT>
adjacency_list<WeightT>
inverse_graph(adjacency_list<WeightT> const &G) {
  size_t const n = G.size();
  adjacency_list<WeightT> F(n);
  for (auto &&es: G) for (auto &&e: es) {
    F[e.to].emplace_back(e.to, e.from, e.weight);
  }
  return F;
}

template <typename WeightT>
edges<WeightT>
all_edges(adjacency_list<WeightT> const &G) {
  auto const E = std::accumulate(begin(G), end(G), 0,
      [](auto x, auto vec) { return x + vec.size(); });
  edges<WeightT> es;
  es.reserve(E);
  for (auto &&vec: G) {
    std::copy(begin(vec), end(vec), std::back_inserter(es));
  }
  return es;
}

} // namespace
namespace { // rooted_tree

struct rooted_tree {
  size_t size;
  std::vector<size_t> topo;
  std::vector<size_t> par;
  std::vector<std::vector<size_t>> children;
};

template <typename WeightT>
rooted_tree make_rooted_tree(adjacency_list<WeightT> const &G, size_t root) {
  size_t N = G.size();
  std::vector<size_t> topo, par(N);
  par[root] = N + 1;
  std::vector<std::vector<size_t>> ch(N);

  std::vector<bool> used(N, false);
  std::stack<size_t> stk;
  stk.push(root); used[root] = true;
  while (!stk.empty()) {
    size_t const u = stk.top(); stk.pop();
    topo.push_back(u);
    for (auto &&e : G[u]) {
      if (used[e.to]) { continue; }
      stk.push(e.to); used[e.to] = true;
      par[e.to] = u;
      ch[u].push_back(e.to);
    }
  }
  return { N, topo, par, ch };
}

} // namespace
template <typename T, typename FnT>
struct product {
  explicit product(FnT const &app, T un, std::vector<T> const &seq):
    fn(app), prefix(seq.size()+1, un), suffix(seq.size()+1, un)
  {
    for (size_t i = 0; i < seq.size(); ++i) {
      prefix[i+1] = fn(prefix[i], seq[i]);
    }
    for (size_t i = seq.size(); i > 0; --i) {
      suffix[i-1] = fn(seq[i-1], suffix[i]);
    }
  }
  T value() const {
    return suffix[0];
  }
  T cut(size_t i) const {
    return fn(prefix[i], suffix[i+1]);
  }
  FnT fn;
  std::vector<T> prefix;
  std::vector<T> suffix;
};

using namespace std;

using Graph = adjacency_list<nullptr_t>;

lli M;
lli mult_modm(lli a, lli b) {
  return (a * b) % M;
}
using Product = product<lli, decltype(&mult_modm)>;

void solve(int N, Graph const &G) {
  auto const tree = make_rooted_tree(G, 0);
  vector<Product> dr(N, Product(mult_modm, 1, {}));
  RREP(i, tree.size) {
    size_t u = tree.topo[i];
    std::vector<lli> ch;
    for (auto &&v : tree.children[u]) {
      ch.push_back(dr[v].value() + 1);
    }
    dr[u] = Product(mult_modm, 1, ch);
  }

  vector<lli> dpar(N);
  dpar[0] = 0;
  REP(i, N-1) {
    size_t u = tree.topo[i];
    REP(j, tree.children[u].size()) {
      size_t v = tree.children[u][j];
      dpar[v] = mult_modm(dpar[u]+1, dr[u].cut(j));
    }
  }
  REP(u, N) {
    cout << mult_modm(dr[u].value(), dpar[u]+1) << endl;
  }
}

int main() {
  int N; cin >> N >> M;
  Graph G(N);
  REP(i, N-1) {
    int X, Y; cin >> X >> Y;
    add_undir_edge(G, --X, --Y, nullptr);
  }
  solve(N, G);
  return 0;
}


Measured memory_bytes: 27948