/*
ID: hepic
PROG: sabotage
LANG: C++11
*/
#include <bits/stdc++.h>

#define FOR(i, a, b) for(auto i=a; i<=b; ++i)
#define REP(i, a, b) for(auto i=a; i<b; ++i)
#define FORI(i, a, b) for(auto i=a; i!=b+1-2*(a>b); i+=1-2*(a>b))
#define REPI(i, a, b) for(auto i=a-(a>b); i!=b-(a>b); i+=1-2*(a>b))
#define ALL(v) v.begin(),v.end()
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define pf(a) push_front(a)
#define eb(a, b) emplace_back(a, b)
#define fir first
#define sec second
#define what_is(x) cout<<#x<<" is "<<x<<endl;
#define type(x) typeid(x).name()
#define ms(arr, val) memset(arr, val, sizeof(arr))
#define min3(a,b,c) min(min(a,b),c)
#define max3(a,b,c) max(max(a,b),c)
#define PI acos(-1)
#define open_read freopen("disrupt.in", "r", stdin)
#define open_write freopen("disrupt.out", "w", stdout)

using namespace std;

typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef pair<double, double> PDD;
typedef pair<int, int> PII;
typedef pair<int, PII> PIPII;
typedef pair<PII, PII> PPIIPII;
typedef pair<LL, LL> PLL;
typedef pair<ULL, ULL> PUU;
typedef pair<LL, PLL> PLPLL;
typedef pair<PLL, PLL> PPLLPLL;
typedef pair<int, LL> PIL;
typedef pair<LL, int> PLI;


template<typename T, typename T1>
ostream& operator << (ostream &out, pair<T, T1> obj)
{
    out << "(" << obj.first << ", " << obj.second << ")";
    return out;
}


template<typename T, typename T1>
ostream& operator << (ostream &out, map<T, T1> cont)
{
    typename map<T, T1>::const_iterator itr = cont.begin();
    typename map<T, T1>::const_iterator ends = cont.end();

    for(; itr!=ends; ++itr)
        out<<*itr<<" ";
    out<<endl;

    return out;
}


template<typename T>
ostream& operator << (ostream &out, set<T> cont)
{
    typename set<T>::const_iterator itr = cont.begin();
    typename set<T>::const_iterator ends = cont.end();

    for(; itr!=ends; ++itr)
        out<<*itr<<" ";
    out<<endl;

    return out;
}


template<typename T>
ostream& operator << (ostream &out, multiset<T> cont)
{
    typename multiset<T>::const_iterator itr = cont.begin();
    typename multiset<T>::const_iterator ends = cont.end();

    for(; itr!=ends; ++itr)
        out<<*itr<<" ";
    out<<endl;

    return out;
}


template<typename T, template<typename ELEM, typename ALLOC=allocator<ELEM>> class CONT>
ostream& operator << (ostream &out, CONT<T> cont)
{
    typename CONT<T>::const_iterator itr = cont.begin();
    typename CONT<T>::const_iterator ends = cont.end();

    for(; itr!=ends; ++itr)
        out<<*itr<<" ";
    out<<endl;

    return out;
}


template<typename T, unsigned int N, typename CTy, typename CTr>
typename enable_if<!is_same<T, char>::value, basic_ostream<CTy, CTr> &>::type
operator << (basic_ostream<CTy, CTr> &out, const T (&arr)[N])
{
     REP(i, 0, N)
        out<<arr[i]<<" ";
    out<<endl;

    return out;
}


template<typename T>
T gcd(T a, T b)
{
    T min_v = min(a, b);
    T max_v = max(a, b);

    while(min_v)
    {
        T temp = max_v % min_v;
        max_v = min_v;
        min_v = temp;
    }

    return max_v;
}


template<typename T>
T lcm(T a, T b)
{
    return (a*b) / gcd(a, b);
}


template<typename T>
T fast_exp_pow(T base, T exp, T mod)
{
    T res = 1;

    while(exp)
    {
        if(exp&1)
        {
            res *= base;
            res %= mod;
        }

        exp >>= 1;
        base *= base;
        base %= mod;
    }

    return res % mod;
}

/*#################################################################################################################
###################################################################################################################
###################################################################################################################
#################################################################################################################*/

#define SIZE 100010

int N, X, Y;
LL M;
LL dpSolve[SIZE][5];
vector<int> graph[SIZE];


void dfs(int node, int par) {
    for (auto connNode: graph[node]) {
        if (connNode != par) {
            dfs(connNode, node);
            dpSolve[node][0] = (dpSolve[node][0] * (dpSolve[connNode][0] + 1)) % M;
        }
    }
}

void dfs1(int node, int par) {
    vector<LL> mult1((int)graph[node].size() + 5), mult2((int)graph[node].size() + 5);
    mult1[0] = mult2[(int)graph[node].size() + 1] = 1;

    for (int i = (int)graph[node].size(); i >= 1; --i) {
        int connNode = graph[node][i - 1];

        if (connNode != par) {
            mult2[i] = (mult2[i + 1] * (dpSolve[connNode][0] + 1)) % M;
        } else {
            mult2[i] = mult2[i + 1];
        }
    }

    FOR (i, 1, (int)graph[node].size()) {
        int connNode = graph[node][i - 1];

        if (connNode != par) {
            LL val = (mult1[i - 1] * mult2[i + 1]) % M;

            val = (val * dpSolve[node][1]) % M;
            val = (val + 1) % M;
            
            dpSolve[connNode][1] = val;
            mult1[i] = (mult1[i - 1] * (dpSolve[connNode][0] + 1)) % M;
            
            dfs1(connNode, node);
        } else {
            mult1[i] = mult1[i - 1];
        }
    }
}


int main() {
    scanf("%d%lld", &N, &M);

    REP (i, 0, N - 1) {
        scanf("%d%d", &X, &Y);
        graph[X].pb(Y);
        graph[Y].pb(X);
    }

    FOR (i, 1, N) {
        dpSolve[i][0] = dpSolve[i][1] = 1;
    }

    dfs(1, 0);
    dfs1(1, 0);
    
    FOR (i, 1, N) {
        printf("%lld\n", (dpSolve[i][0] * dpSolve[i][1]) % M);
    }

    return 0;
}

Measured memory_bytes: 26624