// includes {{{
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<random>
#include<cassert>
// #include<deque>
// #include<multiset>
// #include<bitset>
// #include<cstring>
// #include<bits/stdc++.h>
// }}}
using namespace std;
using ll = long long;

// #undef DEBUG
// #define DEBUG
// DEBUG {{{
#include <array>
#include <deque>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <tuple>
#include <valarray>
#include <vector>
// clang-format off
template<int n, class...T> typename enable_if<(n>=sizeof...(T))>::type _ot(ostream &, tuple<T...> const &){}
template<int n, class...T> typename enable_if<(n< sizeof...(T))>::type _ot(ostream & os, tuple<T...> const & t){ os << (n==0?"":", ") << get<n>(t); _ot<n+1>(os, t); }
template<class...T> ostream & operator<<(ostream &o, tuple<T...> const &t){ o << "("; _ot<0>(o, t); o << ")"; return o; }
template<class T, class U> ostream & operator<<(ostream &o, pair<T, U> const &p) { o << "(" << p.first << ", " << p.second << ")"; return o; }
template < class T > ostream &operator<<(ostream &o, const stack<T> &a) { o << "{"; for(auto tmp = a; tmp.size(); tmp.pop()) o << (a.size() == tmp.size() ? "" : ", ") << tmp.top(); o << "}"; return o; }
template <class T, class Container, class Compare > ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> a) { os << "{ (top) "; while(a.size()) os << a.top() << (a.size() == 1 ? "" : ", "), a.pop(); os << " }"; return os; }
template <class T, class Container > ostream &operator<<(ostream &os, queue<T, Container> a) { os << "{ "; while(a.size()) os << a.front() << (a.size() == 1 ? "" : ", "), a.pop(); os << " }"; return os; }
#ifdef DEBUG
#if !defined(DEBUG_OUT)
#define DEBUG_OUT cerr
#endif
#if !defined(DEBUG_LEFT)
#define DEBUG_LEFT "\e[1;36m"
#endif
#if !defined(DEBUG_RIGHT)
#define DEBUG_RIGHT ":\e[m"
#endif
#define dump(...) [&](){auto __debug_tap=make_tuple(__VA_ARGS__);DEBUG_OUT<<DEBUG_LEFT<<__LINE__ << DEBUG_RIGHT << " " <<#__VA_ARGS__<<" = "<<__debug_tap<<endl;}()
template < class T > inline void dump2D(T &d, size_t sizey, size_t sizex) { for(size_t i = 0; i < sizey; i++) { DEBUG_OUT << "\t"; for(size_t j = 0; j < sizex; j++) DEBUG_OUT << d[i][j] << (j + 1 == sizex ? "" : "\t"); DEBUG_OUT << endl; } }
template < class T, class = typename iterator_traits< decltype(begin(T())) >::value_type, class = typename enable_if<!is_same<T, string>::value>::type > ostream &operator<<(ostream &o, const T &a) { o << "{"; for(auto ite = begin(a); ite != end(a); ++ite) o << (ite == begin(a) ? "" : ", ") << *ite; o << "}"; return o; }
#else
#define dump(...) (42)
#define dump2D(...) (42)
template < class T, class = typename iterator_traits< decltype(begin(T())) >::value_type, class = typename enable_if<!is_same<T, string>::value>::type > ostream &operator<<(ostream &o, const T &a) { for(auto ite = begin(a); ite != end(a); ++ite) o << (ite == begin(a) ? "" : " ") << *ite; return o; }
#endif
// clang-format on
// }}}


const int N = 2e5;
vector<int> g[N];
int n;
int c[N];
int a[N + 1];

void dfs(int i, int p) {
  c[i] = 1;
  for(int j : g[i]) if(j != p) {
    dfs(j, i);
    c[i] += c[j];
    a[c[j]]++;
  }
  a[n - c[i]]++;
}

const int mod = 924844033;

// MAX_N is max size of OUTPUT, DOUBLED INPUT
// MAX_RES_VALUE = MAX_VALUE^2 * MAX_N
// if MAX_N > 2^20, comment out primes!
// NTT {{{
#include <cassert>
#include <cstdint>
#include <vector>

namespace NTT {
  using uint = uint_fast32_t;

  // NTT_PRIMES {{{
  constexpr ll NTT_PRIMES[][2] = {
    {1224736769, 3}, // 2^24 * 73 + 1,
    {1053818881, 7}, // 2^20 * 3 * 5 * 67 + 1
    {1051721729, 6}, // 2^20 * 17 * 59 + 1
    {1045430273, 3}, // 2^20 * 997 + 1
    {1012924417, 5}, // 2^21 * 3 * 7 * 23 + 1
    {1007681537, 3}, // 2^20 * 31^2 + 1
    {1004535809, 3}, // 2^21 * 479 + 1
    {998244353, 3},  // 2^23 * 7 * 17 + 1
    {985661441, 3},  // 2^22 * 5 * 47 + 1
    {976224257, 3},  // 2^20 * 7^2 * 19 + 1
    {975175681, 17}, // 2^21 * 3 * 5 * 31 + 1
    {962592769, 7},  // 2^21 * 3^3 * 17 + 1
    {950009857, 7},  // 2^21 * 4 * 151 + 1
    {943718401, 7},  // 2^22 * 3^2 * 5^2 + 1
    {935329793, 3},  // 2^22 * 223 + 1
    {924844033, 5},  // 2^21 * 3^2 * 7^2 + 1
    {469762049, 3},  // 2^26 * 7 + 1
    {167772161, 3},  // 2^25 * 5 + 1
  };
  // }}}

  // general math {{{
  ll extgcd(ll a, ll b, ll &x, ll &y) {
    ll d;
    return b == 0 ? (x = 1, y = 0, a) : (d = extgcd(b, a % b, y, x), y -= a / b * x, d);
  }
  ll modinv(ll a, ll mod) {
    ll x, y;
    extgcd(a, mod, x, y);
    x %= mod;
    return x < 0 ? x + mod : x;
  }
  ll modpow(ll a, ll b, ll mod) {
    ll r = 1;
    a %= mod;
    while(b) {
      if(b & 1) r = r * a % mod;
      a = a * a % mod;
      b >>= 1;
    }
    return r;
  }
  // }}}

  // NTT Core {{{
  template < int MAX_H >
    struct Pool {
      static ll *tmp, *A, *B;
    };
  template < int MAX_H >
    ll *Pool< MAX_H >::tmp = new ll[1 << MAX_H];
  template < int MAX_H >
    ll *Pool< MAX_H >::A = new ll[1 << MAX_H];
  template < int MAX_H >
    ll *Pool< MAX_H >::B = new ll[1 << MAX_H];

  template < int MAX_H, ll mod, ll primitive >
    class Core {
    public:
      static_assert((mod & ((1 << MAX_H) - 1)) == 1, "mod is too small; comment out");
      // ord zetaList[i] = 2^(i + 1)
      ll zetaList[MAX_H], zetaInvList[MAX_H];
      // constexpr
      Core() {
        zetaList[MAX_H - 1] = modpow(primitive, (mod - 1) / (1 << MAX_H), mod);
        zetaInvList[MAX_H - 1] = modinv(zetaList[MAX_H - 1], mod);
        for(int ih = MAX_H - 2; ih >= 0; --ih) {
          zetaList[ih] = zetaList[ih + 1] * zetaList[ih + 1] % mod;
          zetaInvList[ih] = zetaInvList[ih + 1] * zetaInvList[ih + 1] % mod;
        }
      }
      void fft(ll *a, uint n, uint nh, bool inverse) const {
        ll *tmp = Pool< MAX_H >::tmp;
        uint mask = n - 1;
        for(uint i = n >> 1, ih = nh - 1; i >= 1; i >>= 1, --ih) {
          ll zeta = inverse ? zetaInvList[nh - 1 - ih] : zetaList[nh - 1 - ih];
          ll powZeta = 1;
          for(uint j = 0; j < n; j += i) {
            for(uint k = 0; k < i; ++k) {
              tmp[j | k] =
                (a[((j << 1) & mask) | k] + powZeta * a[(((j << 1) | i) & mask) | k]) % mod;
            }
            powZeta = powZeta * zeta % mod;
          }
          swap(a, tmp);
        }
        if(nh & 1) {
          swap(a, tmp);
          for(uint i = 0; i < n; ++i) a[i] = tmp[i];
        }
        if(inverse) {
          ll invN = modinv(n, mod);
          for(uint i = 0; i < n; ++i) a[i] = a[i] * invN % mod;
        }
      }
      vector< ll > conv(const vector< ll > &a, const vector< ll > &b) const {
        uint t = a.size() + b.size() - 1;
        uint n = 1, nh = 0;
        while(n < t) n <<= 1, ++nh;
        return convStrict(a, b, n, nh);
      }
      vector< ll > convStrict(const vector< ll > &a, const vector< ll > &b, uint n,
          uint nh) const {
        ll *A = Pool< MAX_H >::A, *B = Pool< MAX_H >::B;
        for(uint i = 0; i < n; ++i) A[i] = B[i] = 0;
        copy(a.begin(), a.end(), A);
        copy(b.begin(), b.end(), B);
        fft(A, n, nh, 0), fft(B, n, nh, 0);
        for(uint i = 0; i < n; ++i) A[i] = A[i] * B[i] % mod;
        fft(A, n, nh, 1);
        return vector< ll >(A, A + n);
      }
    };
  // }}}

  // Convolution With Garner {{{
  template < int MAX_H, int I >
    class ConvolutionWithGarnerCore {
    public:
      static void conv_for(uint n, uint nh, const vector< ll > &a, const vector< ll > &b,
          vector< ll > &mods, vector< ll > &coeffs,
          vector< vector< ll > > &constants) {
        static const Core< MAX_H, NTT_PRIMES[I][0], NTT_PRIMES[I][1] > ntt;
        auto c = ntt.convStrict(a, b, n, nh);
        mods[I] = NTT_PRIMES[I][0];
        ConvolutionWithGarnerCore< MAX_H, I - 1 >::conv_for(
            n, nh, a, b, mods, coeffs, constants);
        // garner
        for(size_t i = 0; i < c.size(); ++i) {
          ll v = (c[i] - constants[I][i]) * modinv(coeffs[I], mods[I]) % mods[I];
          if(v < 0) v += mods[I];
          for(size_t j = I + 1; j < mods.size(); ++j) {
            constants[j][i] = (constants[j][i] + coeffs[j] * v) % mods[j];
          }
        }
        for(size_t j = I + 1; j < mods.size(); ++j) {
          coeffs[j] = (coeffs[j] * mods[I]) % mods[j];
        }
      }
    };

  template < int MAX_H >
    class ConvolutionWithGarnerCore< MAX_H, -1 > {
    public:
      static void conv_for(uint, uint, const vector< ll > &, const vector< ll > &,
          vector< ll > &, vector< ll > &, vector< vector< ll > > &) {}
    };

  template < int MAX_H >
    class ConvolutionWithGarner {
    public:
      template < int USE >
        static vector< ll > conv(const vector< ll > &a, const vector< ll > &b, ll mod) {
          static_assert(USE >= 1, "USE must be positive");
          static_assert(USE <= sizeof(NTT_PRIMES) / sizeof(*NTT_PRIMES), "USE is too big");
          uint nt = a.size() + b.size() - 1;
          uint n = 1, nh = 0;
          while(n < nt) n <<= 1, ++nh;
          vector< ll > coeffs(USE + 1, 1);
          vector< vector< ll > > constants(USE + 1, vector< ll >(n));
          vector< ll > mods(USE + 1, mod);
          ConvolutionWithGarnerCore< MAX_H, USE - 1 >::conv_for(
              n, nh, a, b, mods, coeffs, constants);
          return constants.back();
        }
    };

  // }}}

} // namespace NTT
// }}}

// 1st param is MAX_H
// NTT::Core< 19, NTT::NTT_PRIMES[0][0], NTT::NTT_PRIMES[0][1] > nttBig;
NTT::Core< 19, 924844033, 5 > ntt;
// using nttconv = NTT::ConvolutionWithGarner< 19 >;
// nttconv::conv< USE >(a, b, mod)

// WARN : use H with larger N
/// --- Modulo Factorial {{{ ///
template < int N, int mod = (int) 1e9 + 7 >
struct Factorial {
  constexpr ll extgcd(ll a, ll b, ll &x, ll &y) {
    ll d = 0;
    return b == 0 ? (x = 1, y = 0, a) : (d = extgcd(b, a % b, y, x), y -= a / b * x, d);
  }
  constexpr ll modinv(ll a) {
    ll x = 0, y = 0;
    extgcd(a, mod, x, y);
    return (x + mod) % mod;
  }
  int arr[N + 1], inv[N + 1];
  ll operator[](int i) const { return arr[i]; }
#if !defined(DEBUG)
  constexpr
#endif
    Factorial()
    : arr(), inv() {
      arr[0] = 1;
      for(int i = 1; i <= N; i++) {
        arr[i] = (ll) i * arr[i - 1] % mod;
      }
      inv[N] = modinv(arr[N]);
      for(int i = N - 1; i >= 0; i--) {
        inv[i] = (ll)(i + 1) * inv[i + 1] % mod;
      }
    }
  ll C(int n, int r) const {
    if(n < 0 || r < 0 || n < r) return 0;
    return (ll) arr[n] * inv[r] % mod * inv[n - r] % mod;
  }
  ll H(int n, int r) const { return C(n + r - 1, r); }
};
/// }}}--- ///

Factorial < N, mod > fact;

int main() {
  ios::sync_with_stdio(false), cin.tie(0);
  cin >> n;
  for(int i = 0; i < n - 1; i++) {
    int a, b; cin >> a >> b;
    a--; b--;
    g[a].emplace_back(b);
    g[b].emplace_back(a);
  }
  dfs(0, -1);
  vector<ll> A(n + 1);
  vector<ll> B(n + 1);
  for(int i = 0; i <= n; i++) A[i] = fact.inv[n - i];
  for(int i = 1; i <= n; i++) B[i] = fact[i] * a[i] % mod;
  auto C = ntt.conv(A, B);
  for(int k = 1; k <= n; k++) cout << (mod + n * fact.C(n, k) % mod - C[k + n] * fact.inv[k] % mod) % mod << "\n";
  return 0;
}


Measured memory_bytes: 44800