#include <vector>
#include <iostream>
#include <cmath>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <fstream>
#include <unistd.h>
#include <string.h>
#include <string>
#include <numeric>
#include <queue>
#include <deque>
#include <sstream>
#include <iomanip>
#include <set>
#include <stack>
#include <cassert>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<vvd> vvvd;
typedef pair<ll, ll> PL;
typedef vector<PL> vpl;
typedef vector<vector<PL>> vvpl;
const int INF = 1001001001;
const ll LINF = 1e17;
const double pi = 3.1415926535897932;
const string endstr = "\n";
#define FOR(i, a, b) for(ll i = (a); i < b; i++)
#define RFOR(i, a, b) for(ll i = (a); i > b; i--)
#define rep(i, n) for(ll i = 0; i < n; i++)
#define rrep(i, n) for(ll i = n-1; i > -1; i--)
#define FORMAP(it, m) for(auto it = m.begin(); it != m.end(); it++)
#define ff first
#define ss second
#define pb push_back
#define epb emplace_back
#define ALL(X) (X).begin(),(X).end()

template <typename T>
T gcd(T a, T b) {
    return (a == 0) ? b : gcd(b%a, a);
}
template <typename T>
T lcm(T a, T b) {
    return a / gcd(a, b) * b;
}

bool p_comp_fs(const PL p1, const PL p2){ return p1.first < p2.first;};
bool p_comp_fg(const PL p1, const PL p2){ return p1.first > p2.first;};
bool p_comp_ss(const PL p1, const PL p2){ return p1.second < p2.second;};
bool p_comp_sg(const PL p1, const PL p2){ return p1.second > p2.second;};
template <typename T>
vector<T> uniquen(vector<T> vec){
    vec.erase(unique(vec.begin(), vec.end()), vec.end());
    return vec;
}

inline ll popcnt(ll x){return __builtin_popcountll((unsigned long long)x);};
template<class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }

const ll size = 100100;
vl G[size];
vl dp[size];
ll N, M;

ll dfs(ll now, ll par = -1){
    ll m = G[now].size();
    auto& vdp = dp[now];
    vdp = vl(m);
    ll res = 1;
    rep(i, m) if(G[now][i] != par){
        vdp[i] = 1+dfs(G[now][i], now);
        res = res*vdp[i]%M;
    }
    return res;
}

ll ans[size];

void dfs2(ll now, ll x, ll par = -1){
    ll m = G[now].size();
    rep(i, m){
        if(G[now][i] == par) dp[now][i] = (1+x)%M;
    }
    
    vl l = dp[now], r = dp[now];
    rep(i, m-1) l[i+1] = l[i+1]*l[i]%M;
    for(ll i = m-2; i>=0; i--) r[i] = r[i]*r[i+1]%M;
    ans[now] = l.back();
    rep(i, m) if(G[now][i] != par){
        ll xx = (i > 0 ? l[i-1] : 1) * (i < m-1 ? r[i+1] : 1) %M;
        dfs2(G[now][i], xx, now);
    }
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> N >> M;
    if(N == 1){
        cout << 1 << endstr; return 0;
    }
    rep(_, N-1){
        ll x,y; cin >> x >> y; x--; y--;
        G[x].pb(y); G[y].pb(x);
    }
    ll x = dfs(0); dfs2(0, x);
    rep(i, N) cout << ans[i] << endstr;
    return 0;
}


Measured memory_bytes: 25472