#pragma GCC target("avx2")
#pragma GCC optimize("O3")
   
#include <x86intrin.h>
#include <bits/stdc++.h>   
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace __gnu_pbds;
using namespace std;

template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
     
#define F first
#define S second           
#define lb lower_bound               
#define ub upper_bound
#define pb push_back
#define pf push_front    
#define ppb pop_back
#define mp make_pair                                     
#define bpp __builtin_popcountll                                                                                        
#define sqr(x) ((x) * (x)) 
#define al 0x3F3F3F3F
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define in insert
#define ppf pop_front
#define endl '\n'
//#define int long long
 
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
 
int mod = (int)1e9 + 7;
const int N = (int)3e5 + 123;
const ll inf = (ll)1e18 + 1;

const double pi = acos (-1.0);
const double eps = 1e-7;                  
const int dx[] = {0, 0, 1, 0, -1};
const int dy[] = {0, 1, 0, -1, 0};

int n, dp1[N], dp2[N], p[N], pref[N], suff[N], sum[N];
vector <int> g[N];

inline int add (int a, int b) {
   a += b;
   if (a >= mod) a -= mod;
   return a;
}

inline int mult (int a, int b) {
   return 1ll * a * b % mod;
}

void dfs1 (int v = 1, int pr = 0) {
   dp1[v] = 1;
   p[v] = pr;
   for (int i = 0; i < sz (g[v]); i ++) {
      int to = g[v][i];
      if (to == pr) continue;
      dfs1 (to, v);
      dp1[v] = mult (dp1[v], add (dp1[to], 1));
   }
   for (int i = 0; i < sz (g[v]); i ++) {
      int to = g[v][i];
      if (to == pr) {
         pref[i] = (i ? pref[i - 1] : 1);
         continue;
      }
      pref[i] = mult ((i ? pref[i - 1] : 1), add (dp1[to], 1));
   }
   for (int i = sz (g[v]) - 1; i >= 0; i --) {
      int to = g[v][i];
      if (to == pr) {
         suff[i] = (i == sz (g[v]) - 1 ? 1 : suff[i + 1]);
         continue;
      }
      suff[i] = mult ((i == sz (g[v]) - 1 ? 1 : suff[i + 1]), add (dp1[to], 1));
   }
   for (int i = 0; i < sz (g[v]); i ++) {
      int to = g[v][i];
      if (to == pr) continue;
      int l = (i == 0 ? 1 : pref[i - 1]);
      int r = (i == sz (g[v]) - 1 ? 1 : suff[i + 1]);
      sum[to] = mult (l, r);
   }
}

int calc (int v) {
   if (dp2[v] != -1) return dp2[v];
   dp2[v] = 1;
   if (v == 1) return dp2[v];
   dp2[v] = sum[v];
   /*for (auto to : g[p[v]]) {
      if (to == v || to == p[p[v]]) continue;
      dp2[v] = mult (dp2[v], add (dp1[to], 1));
   } */
   dp2[v] = mult (dp2[v], calc (p[v]));
   dp2[v] = add (dp2[v], 1);
   return dp2[v];
}

inline void boost () {                    
   ios_base :: sync_with_stdio (NULL);
   cin.tie (NULL), cout.tie (NULL);          
}                                                     

inline void Solve () {
   cin >> n >> mod;
   for (int i = 1; i < n; i ++) {
      int x, y;
      cin >> x >> y;
      g[x].pb (y);
      g[y].pb (x);
   }
   dfs1 ();
   memset (dp2, -1, sizeof dp2);
   for (int i = 2; i <= n; i ++) {
      calc (i);
   }
   dp2[1] = 1;
   for (int i = 1; i <= n; i ++) cout << mult (dp1[i], dp2[i]) << endl;
}

main () {                                       
// freopen (".in", "r", stdin);    
// freopen (".out", "w", stdout);              
   boost ();
   int tt = 1;
   //cin >> tt;   
   while (tt --) {
      Solve ();
   }                                               
   return 0;      
}
                          

Measured memory_bytes: 23296