#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>   
#include<limits.h>
#include<float.h>
#include<list>
#include <array>
#include <complex>
#include<stdio.h>
#include<string.h>
#include <bitset>

using namespace std;
#define int  long long
 
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(),(x).end()

// int DP[MEM_SIZE][MEM_SIZE] = {0};
// int GMEM[MEM_SIZE][MEM_SIZE] = {0};
template<typename T> void DEBUG(T e){if(DEBUG_OUT == false)return; std::cout << e <<" ";}
template<typename T> void DEBUG(const std::vector<T>& v){if(DEBUG_OUT == false)return;for(const auto& e : v){std::cout<< e << " "; } std::cout << std::endl;}
template<typename T> void DEBUG(const std::vector<std::vector<T> >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } }
template<class T,class... Ts> void DEBUG(T d, Ts... e){if(DEBUG_OUT == false)return;DEBUG(d);DEBUG(e...);}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

int GM;
 
void DFS1(int V,int P,vector<vector<int> > & GRAPH, vector<int> & DP)
{
  DP[V] = 1;
  for (auto &i : GRAPH[V])
  {
    if(i == P)continue;
    DFS1(i,V,GRAPH,DP);
    DP[V] *= DP[i]+1;
    DP[V] %= GM;
  }
  
  
}
void DFS2(int V,int P,int DP_P,vector<vector<int> > & GRAPH, vector<int> & DP)
{
  int N = GRAPH[V].size();
  vector<int> mul1 (N,0);
  vector<int> mul2 (N,0);
  for (int i = 0; i < N; i++)
  {
    int U = GRAPH[V][i];
    if(U == P)
    {
      mul1[i] = mul2[i] = (DP_P + 1)%GM;
      DP[V] *= DP_P + 1;
      DP[V] %= GM;
    }
    else
    {
      mul1[i] = mul2[i] = (DP[U]+1)%GM;
    }
    
  }
  for (int i = 0; i < N-1; i++)
  {
    mul1[i+1] *= mul1[i];
    mul1[i+1] %=GM;
  }
  for (int i = N-1; i > 0; i--)
  {
    mul2[i-1] *= mul2[i];
    mul2[i-1] %= GM;
  }
  for (int i = 0; i < N; i++)
  {
    int U = GRAPH[V][i];
    if(U == P)continue;
    int A =(i? mul1[i-1]:1);
    int B = (i+1<N ? mul2[i+1]:1);
    DFS2(U,V,A*B%GM,GRAPH,DP);
  }
  
  
  
  
}
void solve(void)
{
  int N,M;
   cin>>N>>M;
    vector<vector<int> > GRAPH (N);
   for (int i = 0; i < N-1; i++)
   {
     int A,B;
     cin>>A>>B;
     A--;B--;
     GRAPH[A].push_back(B);
     GRAPH[B].push_back(A);
   }
   GM = M;
   vector<int> DP(N+1,0);
   DFS1(0,-1,GRAPH,DP);
   DFS2(0,-1,0,GRAPH,DP);
   for (int i = 0; i < N; i++)
   {
     cout<<DP[i]%M<<endl;
   }
   
  

  return;
}

int32_t main(int32_t argc, const char *argv[])
{
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);

  std::cout << std::fixed;
  std::cout << std::setprecision(9);
  solve();

  return 0;
}


Measured memory_bytes: 18944