#include <iostream>
#include <array>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <math.h>
#include <string>
#include <climits>
#include <assert.h>
#include <iomanip>
#include <bitset>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <fstream>

#define FOR(i, a, n) for(int i=(a);i<(n); ++i)
#define FOE(i, a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
#define IS_BIT_ON(bit, i) (bit & (1 << i))
#define BIT_ON(bit, i) (bit |= (1 << i))
#define BIT_OFF(bit, i) (bit &= ~(1 << i))
#define BIT_COUNT(bit) (__builtin_popcount(bit))

typedef long long LL;

template<typename T>
std::vector<T> make_v(size_t a) { return std::vector<T>(a); }

template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) { return std::vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...)); }    // C++14
template<typename T, typename V>
typename std::enable_if<std::is_class<T>::value == 0>::type fill_v(T &t, const V &v) { t = v; }

template<typename T, typename V>
typename std::enable_if<std::is_class<T>::value != 0>::type fill_v(T &t, const V &v) { for (auto &e:t) fill_v(e, v); }

template<class T>
inline T ceil(T a, T b) { return (a + b - 1) / b; }

void print() { std::cout << std::endl; }

template<class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
    std::cout << head;
    if (sizeof...(tail) != 0) { std::cout << " "; }
    print(std::forward<Tail>(tail)...);
}

template<class T>
void print(std::vector<T> &v) {
    for (auto &a : v) {
        std::cout << a;
        if (&a != &v.back()) { std::cout << " "; }
    }
    std::cout << std::endl;
}

template<class T>
void print(std::vector<std::vector<T>> &vv) { for (auto &v : vv) { print(v); }}

void debug() { std::cerr << std::endl; }

template<class Head, class... Tail>
void debug(Head &&head, Tail &&... tail) {
    std::cerr << head;
    if (sizeof...(tail) != 0) { std::cerr << " "; }
    print(std::forward<Tail>(tail)...);
}

template<class T>
void debug(std::vector<T> &v) {
    for (auto &a : v) {
        std::cerr << a;
        if (&a != &v.back()) { std::cerr << " "; }
    }
    std::cerr << std::endl;
}

template<class T>
void debug(std::vector<std::vector<T>> &vv) { for (auto &v : vv) { print(v); }}

inline bool inside(long long y, long long x, long long H, long long W) { return 0 <= y and y < H and 0 <= x and x < W; }

template<class T>
inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }

template<class T>
inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }

template<typename T>
T &chmin(T &a, const T &b) { return a = std::min(a, b); }

template<typename T>
T &chmax(T &a, const T &b) { return a = std::max(a, b); }

template<class T>
inline std::vector<T> unique(std::vector<T> v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    return v;
}

long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
    return n * (2 * s + (n - 1) * d) / 2;
}

bool is_power_of_two(long long x) {
    return !(x & (x - 1));
}

long long gcd(long long a, long long b) {
    if (b == 0) { return a; }
    return gcd(b, a % b);
}

long long gcd(std::vector<long long> &v) {
    long long ans = v[0];
    for (int i = 1; i < (int) v.size(); ++i) {
        ans = gcd(ans, v[i]);
    }
    return ans;
}

long long lcm(long long a, long long b) {
    long long g = gcd(a, b);
    return a / g * b;
}

const int INF = 1u << 30u;
const long long LINF = 1ull << 58u;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0};
const std::vector<int> dy4 = {0, 1, 0, -1}, dx4 = {1, 0, -1, 0};
const std::vector<int> dy8 = {0, -1, 0, 1, 1, -1, -1, 1}, dx8 = {1, 0, -1, 0, 1, 1, -1, -1};

using namespace std;

// 全方位木DP
template<typename T>
class Rerooting {
public:
    const int num_of_nodes;
    vector<T> ans;

private:
    vector<vector<int>> tree;
    vector<vector<T>> dp;           // dp[u][i] = uのi番目の子を根とする部分木のdpの値
    T IDENTITY; // mergeの単位元

    // 問題特有の情報
    int M;

public:
    Rerooting(int num_of_nodes, T identity) : num_of_nodes(num_of_nodes), IDENTITY(identity) {
        ans = vector<T>(num_of_nodes);
        tree = vector<vector<int>>(num_of_nodes, vector<int>());
        dp = vector<vector<T>>(num_of_nodes, vector<T>());
    }

    void set_m(int m) {
        this->M = m;
    }

    void add_undirected_edge(const int u, const int v) {
        tree[u].emplace_back(v);
        tree[v].emplace_back(u);
    }

    void solve() {
        int root = 0;
        for (int i = 0; i < num_of_nodes; ++i) {
            dp[i].resize(tree[i].size());
        }

        dfs1(root, -1);
        dfs2(root, -1, IDENTITY);

        for (int u = 0; u < this->num_of_nodes; ++u) {
            ans[u] = IDENTITY;
            for (int i = 0; i < tree[u].size(); ++i) {
                ans[u] = merge(ans[u], f(dp[u][i], tree[u][i]));
            }
            ans[u] = g(ans[u], u);
        }
    }

    void debug() {
        for (int i = 0; i < num_of_nodes; ++i) {
            dp[i].resize(tree[i].size());
        }

        for (int u = 0; u < this->num_of_nodes; ++u) {
            ans[u] = dfs1(u, -1);
        }
    }

private:
    // dp[u] = g(merge(f(dp_c1, c1), f(dp_c2, c2), ...)) ただしcはuの子供
    T g(T a, int node_no = 0) {
        return a;
    }

    T f(T a, int node_no = 0) {
        return (a + 1) % M;
    };

    // 結合束を満たすこと
    T merge(T a, T b) {
        return a * b % M;
    };

    T dfs1(const int u, const int parent) {
        T res = IDENTITY;
        for (int i = 0; i < tree[u].size(); ++i) {
            const int v = tree[u][i];
            if (v != parent) {
                dp[u][i] = dfs1(v, u);
                res = merge(res, f(dp[u][i], tree[u][i]));
            }
        }
        return g(res, u);
    }

    void dfs2(const int u, const int parent, const T add) {
        for (int i = 0; i < tree[u].size(); ++i) {
            const int v = tree[u][i];
            if (v == parent) {
                dp[u][i] = add;
                break;
            }
        }

        // 左からの累積と右からの累積を計算
        vector<T> left(tree[u].size() + 1), right(tree[u].size() + 1);
        {
            left[0] = IDENTITY;
            for (int i = 0; i < tree[u].size(); ++i) {
                left[i + 1] = merge(left[i], f(dp[u][i], tree[u][i]));
            }
            right[tree[u].size()] = IDENTITY;
            for (int i = tree[u].size(); i > 0; --i) {
                right[i - 1] = merge(right[i], f(dp[u][i - 1], tree[u][i - 1]));
            }
        }

        for (int i = 0; i < tree[u].size(); ++i) {
            const int v = tree[u][i];
            if (v == parent) {
                continue;
            }
            // vを除いたuの子のdpの積
            const auto val = merge(left[i], right[i + 1]);
            dfs2(v, u, g(val, u));
        }
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    LL N, M;
    cin >> N >> M;

    Rerooting<LL> rr(N, 1LL);
    rr.set_m(M);

    FOR(i, 0, N - 1) {
        int A, B;
        cin >> A >> B;
        A--;
        B--;
        rr.add_undirected_edge(A, B);
    }

    rr.solve();

    FOR(i, 0, N) {
        print(rr.ans[i]);
    }

    return 0;
}

Measured memory_bytes: 25008