// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <cstring>

#include <algorithm>

#include <cmath>

typedef long long lint;

const int N=262144;

const int mod=924844033;

//5

int n,cal[N],fac[N],inv[N];



inline int nxi(){

	int x=0;

	char c;

	while((c=getchar())>'9'||c<'0');

	while(x=x*10-48+c,(c=getchar())>='0'&&c<='9');

	return x;

}



inline int fpow(int x,int t){

	int ans=1;

	for(; t; x=(lint)x*x%mod,t>>=1){

		if(t&1) ans=(lint)ans*x%mod; 

	}

	return ans;

}



inline void init(){

	fac[0]=1;

	for(int i=1; i<N; ++i) fac[i]=(lint)fac[i-1]*i%mod;

	inv[N-1]=fpow(fac[N-1],mod-2);

	for(int i=N-1; i; --i) inv[i-1]=(lint)inv[i]*i%mod;

}



inline int C(const int x,const int y){

	if(x<y) return 0;

	return (lint)fac[x]*inv[y]%mod*inv[x-y]%mod;

}



namespace G{

	int cnt,fir[N],sz[N];

	struct edge{

		int to,nx;

	}eg[N<<1];



	inline void add(const int a,const int b){

		eg[++cnt]=(edge){b,fir[a]};

		fir[a]=cnt;

	}



	inline void dfs_cal(const int x){

		sz[x]=1;

		for(int i=fir[x]; i; i=eg[i].nx){

			const int y=eg[i].to;

			if(!sz[y]){

				dfs_cal(y);

				++cal[sz[y]];

				sz[x]+=sz[y];

			}

		}

		++cal[n-sz[x]];

	}

}



namespace P{



	void ntt(int *a,int len,bool f){

		static int rev[N<<1];

		for(int i=1; i<len; ++i){

			rev[i]=rev[i>>1]>>1|(i&1?len>>1:0);

			if(i<rev[i]) std::swap(a[i],a[rev[i]]);

		}

		for(int i=1; i<len; i<<=1){

			int t=fpow(5,(mod-1)/(i<<1));

			for(int j=0; j<len; j+=i<<1){

				for(int w=1,k=0; k<i; ++k,w=(lint)w*t%mod){

					lint p=(lint)w*a[j+k+i];

					a[j+k+i]=(a[j+k]-p)%mod;

					a[j+k]=(a[j+k]+p)%mod;

				}

			}

		}

		for(int i=0; i<len; ++i){

			if(a[i]<0) a[i]+=mod;

		}

		if(f==0) return;

		std::reverse(a+1,a+len);

		int tmp=fpow(len,mod-2);

		for(int i=0; i<len; ++i){

			a[i]=(lint)a[i]*tmp%mod;

		}

	}



	class poly{

		public:

			int len,*n;

			poly(int len=0){

				this->len=len;

				n=new int[len+1];

			}

			friend poly operator * (poly a,poly b);

	}ans;



	poly operator * (poly a,poly b){

		static int buka[N<<1],bukb[N<<1];

		poly c(a.len+b.len);

		int len=1;

		while(len<=c.len) len<<=1;

		memset(buka,0,len*sizeof(int));

		memset(bukb,0,len*sizeof(int));

		memcpy(buka,a.n,(a.len+1)*sizeof(int));

		memcpy(bukb,b.n,(b.len+1)*sizeof(int));

		ntt(buka,len,0);

		ntt(bukb,len,0);

		for(int i=0; i<len; ++i){

			buka[i]=(lint)buka[i]*bukb[i]%mod;

		}

		ntt(buka,len,1);

		memcpy(c.n,buka,(c.len+1)*sizeof(int));

		return c;

	}



	inline void get_poly(){

		poly a(n),b(n);

		for(int i=1; i<n; ++i){

			a.n[i]=(lint)cal[i]*fac[i]%mod;

			b.n[i]=inv[n-i-1];

		}

		ans=a*b;

	}

}



int main(){

	init();

	n=nxi();

	for(int i=1; i<n; ++i){

		const int a=nxi(),b=nxi();

		G::add(a,b);

		G::add(b,a);

	}

	G::dfs_cal(1);

	P::get_poly();

	for(int i=1; i<=n; ++i){

		const int all=(lint)n*C(n,i)%mod;

		const int invld=(lint)inv[i]*P::ans.n[n-1+i]%mod;

		printf("%d\n",(all+mod-invld)%mod);

	}

	return 0;

}


// Faster C++ solution for the same problem (measured speedup: 3.843276127534541x):
#include<bits/stdc++.h>

#define maxn 800010

#define P 924844033

#define G 5

using namespace std;

typedef long long ll;

template<typename T> inline void read(T &x)

{

    x=0;char c=getchar();bool flag=false;

    while(!isdigit(c)){if(c=='-')flag=true;c=getchar();}

    while(isdigit(c)){x=(x<<1)+(x<<3)+(c^48);c=getchar();}

    if(flag)x=-x;

}

ll n;

ll rev[maxn],f[maxn],g[maxn],fac[maxn],ifac[maxn],siz[maxn],cnt[maxn];

struct edge

{

    int to,nxt;

}e[maxn];

int head[maxn],edge_cnt;

void add(int from,int to)

{

    e[++edge_cnt]={to,head[from]},head[from]=edge_cnt;

}

ll qp(ll x,ll y)

{

    ll v=1;

    while(y)

    {

        if(y&1) v=v*x%P;

        x=x*x%P,y>>=1;

    }

    return v;

}

int calc(int n)

{

    int lim=1;

    while(lim<=n) lim<<=1;

    for(int i=0;i<lim;++i)

        rev[i]=(rev[i>>1]>>1)|((i&1)?lim>>1:0);

    return lim;

}

void NTT(ll *a,int lim,int type)

{

    for(int i=0;i<lim;++i)

        if(i<rev[i])

            swap(a[i],a[rev[i]]);

    for(int len=1;len<lim;len<<=1)

    {

        ll wn=qp(G,(P-1)/(len<<1));

        for(int i=0;i<lim;i+=len<<1)

        {

            ll w=1;

            for(int j=i;j<i+len;++j,w=w*wn%P)

            {

                ll x=a[j],y=w*a[j+len]%P;

                a[j]=(x+y)%P,a[j+len]=(x-y+P)%P;

            }

        }

    }

    if(type==1) return;

    ll inv=qp(lim,P-2);

    for(int i=0;i<lim;++i) a[i]=a[i]*inv%P;

    reverse(a+1,a+lim);

}

void mul(ll *f,ll *g)

{

    int lim=calc(n<<1);

    NTT(f,lim,1),NTT(g,lim,1);

    for(int i=0;i<lim;++i) f[i]=f[i]*g[i]%P;

    NTT(f,lim,-1);

}

void dfs(int x,int fa)

{

    siz[x]=1;

    for(int i=head[x];i;i=e[i].nxt)

    {

        int y=e[i].to;

        if(y==fa) continue;

        dfs(y,x),siz[x]+=siz[y];

    }

    cnt[siz[x]]++,cnt[n-siz[x]]++;

}

ll C(ll n,ll m)

{

    return fac[n]*ifac[m]%P*ifac[n-m]%P;

}

void init()

{

    fac[0]=ifac[0]=1;

    for(int i=1;i<=n;++i) fac[i]=fac[i-1]*i%P;

    ifac[n]=qp(fac[n],P-2);

    for(int i=n-1;i;--i) ifac[i]=ifac[i+1]*(i+1)%P;

}

int main()

{

    read(n),init();

    for(int i=1;i<n;++i)

    {

        int x,y;

        read(x),read(y);

        add(x,y),add(y,x);

    }

    dfs(1,0),g[0]=1;

    for(int i=1;i<=n;++i) f[i]=cnt[n-i]*fac[n-i]%P,g[i]=ifac[i];

    mul(f,g),reverse(f,f+n+1);

    for(int i=1;i<=n;++i) printf("%lld\n",(n*C(n,i)%P-ifac[i]*f[i]%P+P)%P);

    return 0;

}