#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(12);
  }
}init;

template <typename Cost = int> class Edge{
public:
  int from,to;
  Cost cost;
  Edge() {}
  Edge(int to, Cost cost): to(to), cost(cost){}
  Edge(int from, int to, Cost cost): from(from), to(to), cost(cost){}

  Edge rev() const {return Edge(to,from,cost);}
  
  friend ostream& operator<<(ostream &os, const Edge &e){
    os << "(FROM: " << e.from << "," << "TO: " << e.to << "," << "COST: " << e.cost << ")";
    return os;
  }
};

template <typename T> using Graph = vector<vector<Edge<T>>>;
template <typename T> using Tree = vector<vector<Edge<T>>>;

template <typename C, typename T> void add_edge(C &g, int from, int to, T w){
  g[from].push_back(Edge<T>(from, to, w));  
}

template <typename C, typename T> void add_undirected(C &g, int a, int b, T w){
  g[a].push_back(Edge<T>(a, b, w));
  g[b].push_back(Edge<T>(b, a, w));
}





template <typename T, typename U>
struct ZenhouiTreeDP{
  int N;
  Tree<T> tree;
  vector<int> parent;

  vector<U> sub_dp, bottom_up_dp;
  U id;
 
  ZenhouiTreeDP(const Tree<T> &tree, U id):
    N(tree.size()), tree(tree), parent(N), sub_dp(N), bottom_up_dp(N, id), id(id)
  {
    rooting(0);
  }

  void rooting(int cur, int par = -1){
    auto it = tree[cur].begin();
    while(it != tree[cur].end()){
      if(it->to == par) break;
      ++it;
    }
    if(it != tree[cur].end()) tree[cur].erase(it);

    for(auto &e : tree[cur]){
      rooting(e.to, e.from);
    }
  }

  virtual void subtree_func(int cur, int to){}
  
  void sub_dfs(int cur){
    sub_dp[cur] = id;
    
    for(auto &e : tree[cur]){
      sub_dfs(e.to);
      subtree_func(cur, e.to);
    }
  }

  virtual void bottom_up_func(int cur, int par, U left, U right){}
  virtual U sum_func(U prev, int cur){return 0;}

  void accum_dfs(int cur){
    int size = tree[cur].size();

    vector<U> left_sum(size+1, id);
    U right_sum = id;

    for(int i = 0; i < size; ++i){
      left_sum[i+1] = sum_func(left_sum[i], tree[cur][i].to);
    }

    for(int i = size-1; i >= 0; --i){
      int nxt = tree[cur][i].to;

      bottom_up_func(nxt, cur, left_sum[i], right_sum);
      
      right_sum = sum_func(right_sum, nxt);
      accum_dfs(nxt);
    }
  }
  
};


struct DP : public ZenhouiTreeDP<int, LLI>{
  int M;
  DP(const Tree<int> &tree, int M): ZenhouiTreeDP(tree, 1), M(M){}

  void subtree_func(int cur, int to){
    (sub_dp[cur] *= (sub_dp[to]+1) % M) %= M;
  }

  void bottom_up_func(int cur, int par, LLI left, LLI right){
    (bottom_up_dp[cur] = (bottom_up_dp[par] * left % M * right % M + 1) % M) %= M;
  }
  
  LLI sum_func(LLI prev, int cur){
    return prev * (sub_dp[cur] + 1) % M;
  }

  void run(){
    sub_dfs(0);
    accum_dfs(0);
  }
};


int main(){
  int N, M;
  while(cin >> N >> M){
    Tree<int> tree(N);
    REP(i,N-1){
      int u, v; cin >> u >> v;
      --u, --v;
      add_undirected(tree, u, v, 1);
    }

    DP zdp(tree, M);

    zdp.run();


    REP(i,N){
      LLI ans = zdp.sub_dp[i] * zdp.bottom_up_dp[i] % M;
      cout << ans << endl;
    }
  }

  return 0;
}


Measured memory_bytes: 20992