/*

  "With age, comes wisdom. With travel, comes understanding.
   Remember that happiness is a way of travel – not a destination"

*/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define int            long long int
#define F              first
#define S              second
#define pb             push_back
#define si             set <int>
#define vi             vector <int>
#define pii            pair <int, int>
#define vpi            vector <pii>
#define vpp            vector <pair<int, pii>>
#define mii            map <int, int>
#define mpi            map <pii, int>
#define spi            set <pii>
#define endl           "\n"
#define sz(x)          ((int) x.size())
#define all(p)         p.begin(), p.end()
#define double         long double
#define que_max        priority_queue <int>
#define que_min        priority_queue <int, vi, greater<int>>
#define bug(...)       __f (#__VA_ARGS__, __VA_ARGS__)
#define print(a)       for(auto x : a) cout << x << " "; cout << endl
#define print1(a)      for(auto x : a) cout << x.F << " " << x.S << endl
#define print2(a,x,y)  for(int i = x; i < y; i++) cout<< a[i]<< " "; cout << endl

inline int power(int a, int b)
{
     int x = 1;
     while (b)
     {
          if (b & 1) x *= a;
          a *= a;
          b >>= 1;
     }
     return x;
}

typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> Set;

template <typename Arg1>
void __f (const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << endl; }
template <typename Arg1, typename... Args>
void __f (const char* names, Arg1&& arg1, Args&&... args)
{
     const char* comma = strchr (names + 1, ',');
     cout.write (names, comma - names) << " : " << arg1 << " | "; __f (comma + 1, args...);
}

const int N = 200005;
int a[N], n, m, k;
vi g[N], pre[N], suf[N];
vpi v[N];

int dfs(int i, int p)
{
     for (auto x : g[i])
     {
          if (x != p)
          {
               v[i].pb({dfs(x, i) + 1, x});
          }
     }

     int s = 1;
     pre[i].pb(1);
     suf[i].pb(1);
     for (auto &x : v[i])
     {
          s *= x.F;
          s %= m;
          pre[i].pb(s);
     }
     s = 1;
     for (int j = sz(v[i]) - 1; j >= 0; j--)
     {
          s *= v[i][j].F;
          s %= m;
          suf[i].pb(s);
     }
     reverse(all(suf[i]));
     return s;
}

void dfs1(int i, int val)
{
     val %= m;
     if (!sz(v[i]))
     {
          a[i] = (val + 1) % m;
          return ;
     }
     int ans = (val + 1) * (pre[i].back());

     a[i] = ans % m;

     int l = sz(v[i]);
     for (int j = 0; j < l; j++)
     {
          int prod = (pre[i][j] * suf[i][j + 1]) % m;
          dfs1(v[i][j].S, (val + 1)*prod);
     }

}

void init(int edge)
{
     for (int i = 0; i < edge; i++)
     {
          int x, y; cin >> x >> y;
          g[x].pb(y);
          g[y].pb(x);
     }
}

void solve()
{
     cin >> n >> m;
     init(n - 1);

     dfs(1, 0);
     dfs1(1, 0);

     print2(a, 1, n + 1);

}

int32_t main()
{
     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
     cout << setprecision(9) << fixed;
     clock_t z = clock();
     solve();
     cerr << "Run Time : " << ((double)(clock() - z) / CLOCKS_PER_SEC);

     return 0;
}

Measured memory_bytes: 41344