/*
 *    author:  Gary Shih
 *    created: 2020-05-06 19:35:04
 */
#pragma GCC optimize("O3")
#include <bits/stdc++.h>

using namespace std;

// Debug {{{
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) { return '"' + s + '"'; }

string to_string(const char* s) { return to_string((string)s); }

string to_string(bool b) { return (b ? "true" : "false"); }

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// }}}

int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.setf(ios::fixed), cout.precision(9);
  long long n, m;
  cin >> n >> m;
  vector<vector<long long>> adj(n + 1);
  adj[0].push_back(1);
  adj[1].push_back(0);
  for (long long i = 0; i < n - 1; ++i) {
    long long u, v;
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }

  vector<long long> dp(n + 1, 1);
  function<void(int, int)> dfs1 = [&](int now, int parent) {
    if ((int)adj[now].size() == 1) return;
    for (int child : adj[now]) {
      if (child == parent) continue;
      dfs1(child, now);
      dp[now] *= (dp[child] + 1) % m;
      dp[now] %= m;
    }
  };
  dfs1(1, 0);
  debug(dp);
  function<void(int, int, long long)> dfs2 = [&](int now, int parent,
                                                 long long value) {
    dp[now] *= (value + 1) % m;
    dp[now] %= m;
    if ((int)adj[now].size() > 1) {
      vector<long long> left(adj[now].size(), 1);
      auto right = left;
      for (int i = 1; i < (int)left.size(); ++i) {
        left[i] = left[i - 1];
        if (adj[now][i - 1] != parent) {
          left[i] = (left[i] * (dp[adj[now][i - 1]] + 1)) % m;
        } else {
          left[i] = (left[i] * (value + 1)) % m;
        }
      }
      for (int i = (int)right.size() - 2; i >= 0; --i) {
        right[i] = right[i + 1];
        if (adj[now][i + 1] != parent) {
          right[i] = (right[i] * (dp[adj[now][i + 1]] + 1)) % m;
        } else {
          right[i] = (right[i] * (value + 1)) % m;
        }
      }
      debug(now, value);
      debug(adj[now]);
      debug(left);
      debug(right);
      for (int i = 0; i < (int)adj[now].size(); ++i) {
        int child = adj[now][i];
        if (child == parent) continue;
        dfs2(child, now, (left[i] * right[i]) % m);
      }
    }
  };
  dfs2(1, 0, 0);
  debug(dp);
  for (int i = 1; i <= n; ++i) cout << dp[i] << '\n';
}


Measured memory_bytes: 20096