Language: C++

#pragma region
#include <bits/stdc++.h>
using namespace std;
/*
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
#define int long long
#define REP(i,n) for(int i = 0;i < (int)(n);i++)
#define RREP(i,n) for(int i = (int)n-1;i >= 0;i--)
#define FOR(i,s,n) for(int i = s;i < (int)n;i++)
#define RFOR(i,s,n) for(int i = (int)n-1;i >= s;i--)
#define ALL(a) a.begin(),a.end()
#define IN(a, x, b) (a<=x && x<b)
template<class T>inline bool CHMAX(T&a,T b){if(a<b){a = b;return true;}return false;}
template<class T>inline bool CHMIN(T&a,T b){if(a>b){a = b;return true;}return false;}
template<class T>istream&operator >>(istream&is,vector<T>&vec){for(T&x:vec)is>>x;return is;}
template<class T>inline void in(T&t){cin>>t;}
template<class T,class... Ts>inline void in(T&t,Ts&...ts){cin>>t;in(ts...);}
template<class T>inline void out(T t){cout<<t<<endl;}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout<<t<<" ";out(ts...);}
template<typename T=int>vector<T>mv(size_t a){return vector<T>(a);}
template<typename T=int,typename... Ts>auto mv(size_t a,Ts... ts){return vector<decltype(mv<T>(ts...))>(a,mv<T>(ts...));}
template<typename T,typename V>typename enable_if<is_class<T>::value==0>::type fill(T&t,const V&v){t=v;}
template<typename T,typename V>typename enable_if<is_class<T>::value!=0>::type fill(T&t,const V&v){for(auto &e:t)fill(e,v);}
constexpr long long INF = 1e18;

template<int MOD> struct Fp {
	long long val;
	constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
		if (val < 0) val += MOD;
	}
	constexpr int getmod() { return MOD; }
	constexpr Fp operator - () const noexcept {
		return val ? MOD - val : 0;
	}
	constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
	constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
	constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
	constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
	constexpr Fp& operator += (const Fp& r) noexcept {
		val += r.val;
		if (val >= MOD) val -= MOD;
		return *this;
	}
	constexpr Fp& operator -= (const Fp& r) noexcept {
		val -= r.val;
		if (val < 0) val += MOD;
		return *this;
	}
	constexpr Fp& operator *= (const Fp& r) noexcept {
		val = val * r.val % MOD;
		return *this;
	}
	constexpr Fp& operator /= (const Fp& r) noexcept {
		long long a = r.val, b = MOD, u = 1, v = 0;
		while (b) {
			long long t = a / b;
			a -= t * b; swap(a, b);
			u -= t * v; swap(u, v);
		}
		val = val * u % MOD;
		if (val < 0) val += MOD;
		return *this;
	}
	constexpr bool operator == (const Fp& r) const noexcept {
		return this->val == r.val;
	}
	constexpr bool operator != (const Fp& r) const noexcept {
		return this->val != r.val;
	}
	friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
		return os << x.val;
	}
	friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
		if (n == 0) return 1;
		auto t = modpow(a, n / 2);
		t = t * t;
		if (n & 1) t = t * a;
		return t;
	}
};
 
// 二項係数ライブラリ
template<class T> struct BiCoef {
	vector<T> fact_, inv_, finv_;
	constexpr BiCoef() {}
	constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
		init(n);
	}
	constexpr void init(int n) noexcept {
		fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
		int MOD = fact_[0].getmod();
		for(int i = 2; i < n; i++){
			fact_[i] = fact_[i-1] * i;
			inv_[i] = -inv_[MOD%i] * (MOD/i);
			finv_[i] = finv_[i-1] * inv_[i];
		}
	}
	constexpr T com(int n, int k) const noexcept {
		if (n < k || n < 0 || k < 0) return 0;
		return fact_[n] * finv_[k] * finv_[n-k];
	}
	constexpr T fact(int n) const noexcept {
		if (n < 0) return 0;
		return fact_[n];
	}
	constexpr T inv(int n) const noexcept {
		if (n < 0) return 0;
		return inv_[n];
	}
	constexpr T finv(int n) const noexcept {
		if (n < 0) return 0;
		return finv_[n];
	}
};
 
//const int MOD = 1000000007;
//const int MOD = 998244353;
//using mint = Fp<MOD>;
//BiCoef<mint> bc;
// bc.init(500050);
#pragma endregion



signed main(){
	int N,MOD;
	in(N,MOD);
	vector<vector<int>>g(N);
	REP(i,N-1){
		int a,b;
		in(a,b);
		a--;b--;
		g[a].emplace_back(b);
		g[b].emplace_back(a);
	}
	auto dp = mv<vector<int>>(N);
	REP(i,N)dp[i].resize(g[i].size());
	auto dfs = [&](auto&&f,int now,int par)->int{
		int ret = 1;
		REP(i,g[now].size()){
			auto e = g[now][i];
			if(e == par)continue;
			dp[now][i] = f(f,e,now);
			(ret *= (1 + dp[now][i]))%=MOD;
		}
		return ret;
	};
	int t = dfs(dfs,0,-1);
	auto dfs2 = [&](auto&&f,int now,int par,int p)->void{
		REP(i,g[now].size()){
			int e = g[now][i];
			if(e == par)dp[now][i] = p;
		}
		auto l = mv(g[now].size()),r = l;
		REP(i,g[now].size()){
			l[i]=(i?l[i-1]:1)*(1+dp[now][i])%=MOD;
		}
		RREP(i,g[now].size()){
			r[i]=(i!=g[now].size()-1?r[i+1]:1)*(1+dp[now][i])%=MOD;
		}
		REP(i,g[now].size()){
			auto e = g[now][i];
			if(e == par)continue;
			int mul = (i?l[i-1]:1)*(i!=g[now].size()-1?r[i+1]:1)%=MOD;
			f(f,e,now,mul);
		}
	};
	dfs2(dfs2,0,-1,0);
	REP(i,N){
		int mul = 1;
		for(auto e:dp[i])(mul *= 1 + e) %= MOD;
		out(mul);
	}
}

Compiler output:
a.cc: In lambda function:
a.cc:159:42: error: lvalue required as left operand of assignment
  159 |                         l[i]=(i?l[i-1]:1)*(1+dp[now][i])%=MOD;
      |                              ~~~~~~~~~~~~^~~~~~~~~~~~~~~
a.cc:162:59: error: lvalue required as left operand of assignment
  162 |                         r[i]=(i!=g[now].size()-1?r[i+1]:1)*(1+dp[now][i])%=MOD;
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
a.cc:167:47: error: lvalue required as left operand of assignment
  167 |                         int mul = (i?l[i-1]:1)*(i!=g[now].size()-1?r[i+1]:1)%=MOD;
      |                                   ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~