#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define int ll
#define unordered_map map
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef vector<piii> vpii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<pii> vpi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
typedef complex<double> base;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define mp(a, b) make_pair(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cout << (#x) << " = " << x << endl;
#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif


void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
    cerr << *it << " = " << a << endl;
    err(++it, args...);
}

const double PI = 2 * acos(0.0);

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";


istream &operator >> (istream &in, pii &a)
{
    in >> a.first >> a.second;
    return in;
}


ostream &operator << (ostream &out, pii &a)
{
    out << a.first << ' ' << a.second;
    return out;
}


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) <<
               ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void smain();

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

#ifdef ART_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(12) << fixed;
    smain();
#ifdef ART_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
}


const int N = 1 << 17;

vi vertices[N];
int par[N], dp1[N][2], dp2[N][2], cnt[N], n, M;
unordered_map<int, int> tries[N];
unordered_map<int, int> r_tries[N];


inline int MOD(int v)
{
    return (v % M + M) % M;
}


void add(unordered_map<int, int> &t, int ind, int v)
{
    for (int i = ind; i < N; i += i&-i)
        if (!t.count(i))
            t[i] = v;
        else
            t[i] = MOD(t[i] * v);
}


int get(unordered_map<int, int> &t, int ind)
{
    int cnt = 1;
    for (int i = ind; i; i -= i&-i)
        if (t.count(i))
            cnt = MOD(cnt * t[i]);

    return cnt;
}


void dfs(int v, int p = -1) {

    par[v] = p;
    for (int u : vertices[v]) {
        if (u == p)
            continue;

        dfs(u, v);
    }

    dp1[v][0] = 1;
    dp1[v][1] = 1;

    for (int u : vertices[v]) {
        if (u == p)
            continue;

        dp1[v][1] = MOD(dp1[v][1] * (dp1[u][1] + 1));
        dp1[v][0] = MOD(dp1[v][0] + dp1[u][1] + dp1[u][0] - 1);
    }

    for (int u : vertices[v])
        if (u != par[u])
        {
            cnt[v] = MOD(cnt[v] + dp1[u][0] + dp1[u][0] - 1);
            add(tries[v], u, MOD(dp1[u][1] + 1));
            add(r_tries[v], N - u, MOD(dp1[u][1] + 1));
        }
}

void dfs2(int v, int p = -1)
{

    dp2[v][0] = dp2[v][1] = 1;


    if (p != -1) {

        dp2[v][0] = MOD(dp2[v][0] + dp2[p][0] - 1);
        dp2[v][0] = MOD(dp2[v][0] + cnt[p] - (dp1[v][0] + dp1[v][1] - 1));

        int cnt = MOD(MOD(dp2[p][1] * get(tries[p], v - 1)) * get(r_tries[p], N - v - 1));

        dp2[v][0] = MOD(dp2[v][0] + cnt);
        dp2[v][1] = MOD(dp2[v][1] + cnt);
    }

    for (int u : vertices[v]) {
        if (u == p)
            continue;

        dfs2(u, v);
    }

}


void smain()
{
    cin >> n >> M;
    for (int i = 1; i < n; ++i)
    {
        int a, b;
        cin >> a >> b;
        vertices[a].push_back(b);
        vertices[b].push_back(a);
    }

    dfs(1);
    dfs2(1);

    for (int i = 1; i <= n; ++i)
        cout << MOD(dp1[i][1] * dp2[i][1]) << ' ';
}

Measured memory_bytes: 235136