// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < int(n); i++)
#define rep1(i,n) for (int i = 1; i <= int(n); i++)
#define repR(i,n) for (int i = int(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = int(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#ifdef LOCAL
#define dump(...) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", my_dmp(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl;
void my_dmp(const char*) { cerr << endl; }
template <class T, class... U> void my_dmp(const char *s, T const& x, U const& ...y) { const char *o = "({[", *e = "]})"; for (int i = 0; *s != '\0'; cerr << *s++) { if (count(o,o+3,*s)) i++; if (count(e,e+3,*s)) i--; if (!i && *s == ',') break; } cerr << " = " << x; if (*s == ',') cerr << ", ", s++; my_dmp(s, y...); }
#else
#define dump(...)
#define say(x)
#endif
using ll = long long;
using ld = long double;
#define int ll
#define double ld
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { os << "{"; for (auto const& x : v) os << " " << x; return os << " }"; }
template <class T> istream& operator>>(istream& is, vector<T>& v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
template <size_t i, class T> typename enable_if<i >= tuple_size<T>::value>::type output_tuple(ostream&, T const&) { }
template <size_t i = 0, class T> typename enable_if<i < tuple_size<T>::value>::type
output_tuple(ostream& os, T const& t) { os << (i ? " " : "") << get<i>(t); output_tuple<i+1,T>(os,t); }
template <class... T> ostream& operator<<(ostream& os, tuple<T...> const& t) { return output_tuple(os,t), os; }
struct my_Init { my_Init() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } my_init;
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
const ll INF = (1LL<<62)-1; // ~ 4.6e18
// <<<
// >>> runtime modint
using ll = long long;
class runtime_modint {
    using M = runtime_modint;
    ll x;
public:
    static ll& mod() { static int mod = 0; return mod; }
    runtime_modint(ll x = 0) {
        assert(mod() > 0); this->x = ((x%=mod()) < 0 ? x+mod() : x);
    }
    ll val() const { return x; }
    bool operator==(M r) const { return x == r.x; }
    bool operator!=(M r) const { return x != r.x; }
    M operator+() const { return *this; }
    M operator-() const { return {mod()-x}; }
    M& operator+=(M r) { if ((x += r.x) >= mod()) x -= mod(); return *this; }
    M& operator-=(M r) { if ((x += mod()-r.x) >= mod()) x -= mod(); return *this; }
    M& operator*=(M r) { (x *= r.x) %= mod(); return *this; }
    M operator+(M r) const { return M(*this) += r; }
    M operator-(M r) const { return M(*this) -= r; }
    M operator*(M r) const { return M(*this) *= r; }
    M& operator/=(M r) { return *this *= r.inv(); }
    M operator/(M r) const { return *this * r.inv(); }
    M pow(ll n) const {
        if (n < 0) return inv().pow(-n);
        M v = *this, r = 1;
        for (; n > 0; n >>= 1, v *= v) if (n&1) r *= v;
        return r;
    }
    M inv() const {
        assert(x != 0);
        ll t = 1, v = x, q, r;
        while (v != 1) {
            q = mod() / v; r = mod() % v;
            if (r * 2 < v) {
                t *= -q; t %= mod(); v = r;
            } else {
                t *= q + 1; t %= mod(); v -= r;
            }
        }
        return t;
    }
};
ostream& operator<<(ostream& os, runtime_modint r) { return os << r.val(); }
istream& operator>>(istream& is, runtime_modint &r) { ll x; is >> x; r = x; return is; }

using mint = runtime_modint;
// <<<

// ほぼ写経
// https://ei1333.github.io/luzhiled/snippets/tree/rerooting.html

template <class Handler>
struct ReRooting : Handler {
    using data = typename Handler::data; // edge data
    using dp_t = typename Handler::dp_t; // internal dp data
    using res_t = typename Handler::res_t; // res of dfs
    using Handler::unit; // () -> dp_t
    using Handler::join; // (dp_t,res_t,edge) -> dp_t
    using Handler::merge; // (dp_t,dp_t) -> res_t
    struct edge {
        int32_t to,rev; data d;
        edge(int32_t to, int32_t rev, data const& d) : to(to),rev(rev),d(d) {}
    };
    int n;
    vector<vector<edge> > g;
    vector<vector<dp_t> > ldp,rdp;
    vector<int32_t> l,r;
    ReRooting(int n = 0) : n(n), g(n), ldp(n), rdp(n), l(n), r(n) {}
    void resize(int n) {
        this->n = n; g.resize(n);
        ldp.resize(n); rdp.resize(n); l.resize(n), r.resize(n);
    }
    void add_edge(int x, int y, data const& d) {
        g[x].emplace_back(y, g[y].size(), d);
        g[y].emplace_back(x, g[x].size()-1, d);
        // g[x].emplace_back(edge { y, (int)g[y].size(), d });
        // g[y].emplace_back(edge { x, (int)g[x].size()-1, d });
    }
    void add_edge(int x, int y, data const& d, data const& e) {
        g[x].emplace_back(y, g[y].size(), d);
        g[y].emplace_back(x, g[x].size()-1, e);
    }
    vector<res_t> run() {
        rep (i,n) {
            ldp[i].resize(g[i].size()+1, unit());
            rdp[i].resize(g[i].size()+1, unit());
            l[i] = 0; r[i] = g[i].size()-1;
        }
        vector<res_t> ret; ret.reserve(n);
        rep (i,n) ret.emplace_back(dfs(i,-1));
        return ret;
    }
    res_t dfs(int x, int p) {
        auto const& e = g[x];
        for (int32_t &i = l[x]; i != p && i < (int32_t)e.size(); ++i) {
            ldp[x][i+1] = join(ldp[x][i], dfs(e[i].to, e[i].rev), e[i].d);
        }
        for (int32_t &j = r[x]; j != p && j >= 0; --j) {
            rdp[x][j] = join(rdp[x][j+1], dfs(e[j].to, e[j].rev), e[j].d);
        }
        if (p < 0) return rdp[x][0];
        return merge(ldp[x][p], rdp[x][p+1]);
    }
};

struct Handler {
    using data = void*;
    using dp_t = mint;
    using res_t = mint;
    static dp_t unit() { return 1; }
    static dp_t join(dp_t const& x, res_t const& y, data const&) {
        return x*(y+1);
    }
    static res_t merge(dp_t const& x, dp_t const& y) {
        return x*y;
    }
};

int32_t main() {
    int n,m; cin >> n >> m;
    mint::mod() = m;
    ReRooting<Handler> rr(n);
    rep (i,n-1) {
        int x,y; cin >> x >> y; x--,y--;
        rr.add_edge(x,y,0);
    }
    for (auto x : rr.run()) {
        cout << x << "\n";
    }
}


Measured memory_bytes: 28672