#include <bits/stdc++.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl

typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = 1e18;
//const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//#define mp make_pair

const int N = 100010;
ll MOD;
vii G(N);
vl dp(2*N, -1);
map<pii, int> edge2idx;

ll dfs(int now, int par) {
  int idx = -1;
  if (par >= 0) {
    idx = edge2idx[pii(par, now)];
    dp[idx] = 1;
  }
  rep (i, G[now].size()) {
    if (G[now][i] == par) continue;
    ll temp = (dfs(G[now][i], now) + 1) % MOD;
    if (idx >= 0) {
      (dp[idx] *= temp) %= MOD;
    }
  }
  if (idx >= 0) {
    return dp[idx];
  }
}

ll dfs2(int now, int par) {
  int n = G[now].size();
  vl sum1(n + 1, 1), sum2(n + 1, 1);
  rep (i, n) {
    int v = G[now][i];
    sum1[i + 1] = sum1[i] * (dp[edge2idx[pii(now, v)]] + 1) % MOD;
  }
  rrep (i, n) {
    int v = G[now][i];
    sum2[i] = sum2[i + 1] * (dp[edge2idx[pii(now, v)]] + 1) % MOD;
  }
  rep (i, n) {
    int v = G[now][i];
    int idx = edge2idx[pii(v, now)];
    if (dp[idx] >= 0) continue;
    dp[idx] = sum1[i] * sum2[i + 1] % MOD;
  }
  rep (i, n) {
    if (G[now][i] == par) continue;
    dfs2(G[now][i], now);
  }
}

int main() {
  int n;
  cin >> n >> MOD;
  rep (i, n - 1) {
    int u, v;
    cin >> u >> v;
    u--; v--;
    G[u].push_back(v);
    G[v].push_back(u);
    edge2idx[pii(u, v)] = 2*i;
    edge2idx[pii(v, u)] = 2*i + 1;
  }
  rep (i, n) {
    sort(all(G[i]));
  }
  dfs(0, -1);
  dfs2(0, -1);
  rep (i, n) {
    ll ans = 1;
    rep (j, G[i].size()) {
      int idx = edge2idx[pii(i, G[i][j])];
      ans = ans * (dp[idx] + 1) % MOD;
    }
    cout << ans << endl;
  }
}
  
  


Measured memory_bytes: 37760