#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define vi vector<int>
#define vll vector<ll>
 
const int g = 3, mod = 998244353, p = 998244353;
 
inline int add(int x, int y){ x += y; if(x >= mod) x -= mod; return x;}
inline int sub(int x, int y){ x -= y; if(x < 0) x += mod; return x;}
inline int mul(int x, int y){ return (x * 1ll * y) % mod;}
 
inline void ADD(int & a, int b){
    a += b;
    if(a >= mod) a -= mod;
}
 
inline int powr(int a, ll b){
    int x = 1 % mod;
    while(b){
        if(b & 1) x = mul(x, a);
        a = mul(a, a);
        b >>= 1;
    }
    return x;
}
inline int inv(int a){ return powr(a, mod - 2);}
 
const int MX = 15;
int W[1 << MX], invW[1 << MX]; // max polynomial input/output -> (1 << MX)
int maxn, MAXN;
 
void precompute_powers(){
    int p2 = p - 1;
    while(p2 % 2 == 0){
        p2 >>= 1;
        MAXN ++;
    }
    MAXN = min(MAXN, MX);
    int g1 = powr(g, (p - 1) >> MAXN);
    maxn = 1 << MAXN;
    int st = 1;
    for(int i = 0; i < maxn; i++){
        W[i] = st;
        st = mul(st, g1);
    }
    for(int i = 0; i < maxn; i++){
        invW[i] = (i == 0) ? 1 : W[maxn - i];
    }
}
 
void fft (vector<int> & a, bool invert) {
    int n = (int) a.size();
 
    for (int i=1, j=0; i<n; ++i) {
        int bit = n >> 1;
        for (; j>=bit; bit>>=1)
            j -= bit;
        j += bit;
        if (i < j)
            swap (a[i], a[j]);
    }
 
    for (int len=2; len<=n; len<<=1) {
        for (int i=0; i<n; i+=len) {
            int ind = 0,ADD = maxn/len;
            for (int j=0; j<len/2; ++j) {
                int u = a[i+j],  v = mul(a[i+j+len/2], (invert?invW[ind]:W[ind]));
                a[i+j] = add(u, v);
                a[i+j+len/2] = sub(u, v);
                ind += ADD;
            }
        }
    }
    if (invert){
        int invn = inv(n);
        for (int i=0; i<n; ++i) a[i] = mul(a[i], invn);
    }
}
 
vi add(vi a, vi b){
    vi ret(max(a.size(), b.size()));
    for(int i = 0; i < ret.size(); i++){
        ret[i] = add(i < a.size() ? a[i] : 0, i < b.size() ? b[i] : 0);
    }
    return ret;
}
 
vi sub(vi a, vi b){ 
    vi ret(max(a.size(), b.size()));
    for(int i = 0; i < ret.size(); i++){
        ret[i] = sub(i < a.size() ? a[i] : 0, i < b.size() ? b[i] : 0);
    }
    return ret;
}
 
vi mul(vi a, vi b){
    int sz = a.size() + b.size() - 1;
    int k = 0;
    while((1 << k) < sz) k++;
    a.resize(1 << k); b.resize(1 << k);
    fft(a, 0); fft(b, 0);
    for(int i = 0; i < (1 << k); i++)
        a[i] = mul(a[i], b[i]);
    fft(a, 1);
    a.resize(sz);
    return a;
}
 
vi inverse(vi a, int sz){
    assert(a[0] != 0);
    vi x = {inv(a[0])};
    while(x.size() < sz){
        vi temp(a.begin(), a.begin() + min(a.size(), 2 * x.size()));
        vi nx = mul(mul(x, x), temp);
        x.resize(2 * x.size());
        for(int i = 0; i < x.size(); i++)
            x[i] = sub(add(x[i], x[i]), nx[i]);
    }
    x.resize(sz);
    return x;
}
 
vi shorten(vi x, int k){
    x.resize(min((int)x.size(), k));
    return x;
}
 
vi truncate_end(vi v){
    while(!v.empty() && v.back() == 0) v.pop_back();
    if(v.empty()) v = {0};
    return v;
}
 
void print(vi v){
    cerr << "["; 
    for(int i = 0; i < v.size(); i++){
        cerr << v[i];
        if(i + 1 != v.size()) cerr <<" ";
        else cerr << "]";
    }
    cerr << endl;
}
 
vi _inv;
// _inv = inverse(rev(g))
pair<vi, vi> divmod(vi f, vi g){
    if(f.size() < g.size()) return {{0}, f};
    int sz = f.size() - g.size() + 1;
    reverse(f.begin(), f.end()); reverse(g.begin(), g.end());
    vi inv2 = _inv; 
    inv2.resize(sz);
    vi _p = f; _p.resize(sz);
    vi q = mul(inv2, _p);
    q.resize(sz);
    reverse(q.begin(), q.end()); reverse(f.begin(), f.end()); reverse(g.begin(), g.end());
    return {q, truncate_end(sub(f, mul(g, q)))};
}
 
const int N = 3005;
 
int st[N][N];
int beg;
struct tree{
    int n;
    vector<vector<int> > con;
    tree(int n) : n(n), con(n + 1) {}
 
    void add_edge(int a, int b){
        con[a].push_back(b);
        con[b].push_back(a);
    }
    // compute characteristic polynomial at a given value
    int get(int x){
        vector<bool> U(n + 1, 1);
        vector<int> a(n + 1, x);
        int d = 0;
        function<void(int, int)> dfs = [&](int s, int p){
            bool deleted = 0;
            for(int v : con[s]) if(v != p){
                dfs(v, s);
                if(U[v] && a[v] == 0 && !deleted){
                    U[v] = U[s] = 0;
                    deleted = 1;
                    d++;
                } else if(U[v] && !deleted){
                    a[s] = sub(a[s],  inv(a[v]));
                }
            }
        };
        dfs(1, -1);
        int ret = powr(mod - 1, d);
        for(int i = 1; i <= n; i++) if(U[i]) ret = mul(ret, a[i]);
        return ret;
    }
    // get characteristic polynomial
    vector<int> getCharPoly(){
        int sz = n + 1;
        int k = 0;
        while((1 << k) < sz) k++;
        vector<int> eval(1 << k);
 
        for(int i = 0; i < (1 << k); i++){
            eval[i] = get(sub(mod, W[i << (MAXN - k)]));
        }
 
        fft(eval, 1);
        while(!eval.empty() && eval.back() == 0) eval.pop_back();
 
        int m = eval.size();
        return eval;
    }
    // precompute for small values of k
    void compute_st(){
        st[0][beg] = 1;
        for(int j = 1; j <= n; j++){
            for(int i = 1; i <= n; i++){
                    for(int i2 : con[i]){
                        ADD(st[j][i], st[j - 1][i2]);
                    }
            }
        }
    }
};
 
map<int, vi> cache;
vi char_poly;
 
vi get(int k){
    if(cache.find(k) != cache.end()) return cache[k];
    int store_k = k;
    vi A = {1};
    vi B = {0, 1};
    for(; k; k >>= 1, B = divmod(mul(B, B), char_poly).second) if(k & 1){
        A = divmod(mul(A, B), char_poly).second;
    }
    return cache[store_k] = A;
}
 
 
int main(){
    srand(time(NULL));
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    precompute_powers();
    int n = 1000;
    cin >> n;
    assert(n <= 3000);
    tree T(n);
    for(int i = 1; i < n; i++){
        int x, y;
        x = i + 1; y = rand() % i + 1;
        cin >> x >> y;
        assert(x >= 1 && x <= n && y >= 1 && y <= n &&  x != y);
        T.add_edge(x, y);
    }
    char_poly = T.getCharPoly();
    reverse(char_poly.begin(), char_poly.end());
    _inv = inverse(char_poly, n + 10);
    reverse(char_poly.begin(), char_poly.end());
    int a, b, k;
    a = rand() % n + 1, b = rand() % n + 1, k = n + 1 + rand() % n;
    cin >> a >> k;  
 
    assert(a >= 1  && a <= n);
    assert(k >= 0 && k <= 1e9);
 
    beg = a;
    T.compute_st();
    if(k <= n){ 
        for(int b = 1; b <= n; b++)
            cout << st[k][b] << " ";
        return 0;
    }
 
    vi poly = get(k);
    poly.resize(n);
    for(int b = 1; b <= n; b++){
        int ret = 0;
        for(int i = 0; i < n; i++) ret = add(ret, mul(poly[i], st[i][b]));  
        cout << ret << " ";
    }
}

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define vi vector<int>
#define vll vector<ll>

const int g = 3, mod = 998244353, p = 998244353;

inline int add(int x, int y){ x += y; if(x >= mod) x -= mod; return x;}
inline int sub(int x, int y){ x -= y; if(x < 0) x += mod; return x;}
inline int mul(int x, int y){ return (x * 1ll * y) % mod;}

inline void ADD(int & a, int b){
    a += b;
    if(a >= mod) a -= mod;
}

inline int powr(int a, ll b){
    int x = 1 % mod;
    while(b){
        if(b & 1) x = mul(x, a);
        a = mul(a, a);
        b >>= 1;
    }
    return x;
}
inline int inv(int a){ return powr(a, mod - 2);}

const int MX = 15;
int W[1 << MX], invW[1 << MX]; // max polynomial input/output -> (1 << MX)
int maxn, MAXN;

void precompute_powers(){
    int p2 = p - 1;
    while(p2 % 2 == 0){
        p2 >>= 1;
        MAXN ++;
    }
    MAXN = min(MAXN, MX);
    int g1 = powr(g, (p - 1) >> MAXN);
    maxn = 1 << MAXN;
    int st = 1;
    for(int i = 0; i < maxn; i++){
        W[i] = st;
        st = mul(st, g1);
    }
    for(int i = 0; i < maxn; i++){
        invW[i] = (i == 0) ? 1 : W[maxn - i];
    }
}

void fft (vector<int> & a, bool invert) {
    int n = (int) a.size();

    for (int i=1, j=0; i<n; ++i) {
        int bit = n >> 1;
        for (; j>=bit; bit>>=1)
            j -= bit;
        j += bit;
        if (i < j)
            swap (a[i], a[j]);
    }

    for (int len=2; len<=n; len<<=1) {
        for (int i=0; i<n; i+=len) {
            int ind = 0,ADD = maxn/len;
            for (int j=0; j<len/2; ++j) {
                int u = a[i+j],  v = mul(a[i+j+len/2], (invert?invW[ind]:W[ind]));
                a[i+j] = add(u, v);
                a[i+j+len/2] = sub(u, v);
                ind += ADD;
            }
        }
    }
    if (invert){
        int invn = inv(n);
        for (int i=0; i<n; ++i) a[i] = mul(a[i], invn);
    }
}

vi add(vi a, vi b){
    vi ret(max(a.size(), b.size()));
    for(int i = 0; i < ret.size(); i++){
        ret[i] = add(i < a.size() ? a[i] : 0, i < b.size() ? b[i] : 0);
    }
    return ret;
}

vi sub(vi a, vi b){ 
    vi ret(max(a.size(), b.size()));
    for(int i = 0; i < ret.size(); i++){
        ret[i] = sub(i < a.size() ? a[i] : 0, i < b.size() ? b[i] : 0);
    }
    return ret;
}

vi mul(vi a, vi b){
    int sz = a.size() + b.size() - 1;
    int k = 0;
    while((1 << k) < sz) k++;
    a.resize(1 << k); b.resize(1 << k);
    fft(a, 0); fft(b, 0);
    for(int i = 0; i < (1 << k); i++)
        a[i] = mul(a[i], b[i]);
    fft(a, 1);
    a.resize(sz);
    return a;
}

vi inverse(vi a, int sz){
    assert(a[0] != 0);
    vi x = {inv(a[0])};
    while(x.size() < sz){
        vi temp(a.begin(), a.begin() + min(a.size(), 2 * x.size()));
        vi nx = mul(mul(x, x), temp);
        x.resize(2 * x.size());
        for(int i = 0; i < x.size(); i++)
            x[i] = sub(add(x[i], x[i]), nx[i]);
    }
    x.resize(sz);
    return x;
}

vi shorten(vi x, int k){
    x.resize(min((int)x.size(), k));
    return x;
}

vi truncate_end(vi v){
    while(!v.empty() && v.back() == 0) v.pop_back();
    if(v.empty()) v = {0};
    return v;
}

void print(vi v){
    cerr << "["; 
    for(int i = 0; i < v.size(); i++){
        cerr << v[i];
        if(i + 1 != v.size()) cerr <<" ";
        else cerr << "]";
    }
    cerr << endl;
}

vi _inv;
// _inv = inverse(rev(g))
pair<vi, vi> divmod(vi f, vi g){
    if(f.size() < g.size()) return {{0}, f};
    int sz = f.size() - g.size() + 1;
    reverse(f.begin(), f.end()); reverse(g.begin(), g.end());
    vi inv2 = _inv; 
    inv2.resize(sz);
    vi _p = f; _p.resize(sz);
    vi q = mul(inv2, _p);
    q.resize(sz);
    reverse(q.begin(), q.end()); reverse(f.begin(), f.end()); reverse(g.begin(), g.end());
    return {q, truncate_end(sub(f, mul(g, q)))};
}

const int N = 3005;

int st[N][N];
int beg;
struct tree{
    int n;
    vector<vector<int> > con;
    tree(int n) : n(n), con(n + 1) {}

    void add_edge(int a, int b){
        con[a].push_back(b);
        con[b].push_back(a);
    }
    // compute characteristic polynomial at a given value
    int get(int x){
        vector<bool> U(n + 1, 1);
        vector<int> a(n + 1, x);
        int d = 0;
        function<void(int, int)> dfs = [&](int s, int p){
            bool deleted = 0;
            for(int v : con[s]) if(v != p){
                dfs(v, s);
                if(U[v] && a[v] == 0 && !deleted){
                    U[v] = U[s] = 0;
                    deleted = 1;
                    d++;
                } else if(U[v] && !deleted){
                    a[s] = sub(a[s],  inv(a[v]));
                }
            }
        };
        dfs(1, -1);
        int ret = powr(mod - 1, d);
        for(int i = 1; i <= n; i++) if(U[i]) ret = mul(ret, a[i]);
        return ret;
    }
    // get characteristic polynomial
    vector<int> getCharPoly(){
        int sz = n + 1;
        int k = 0;
        while((1 << k) < sz) k++;
        vector<int> eval(1 << k);

        for(int i = 0; i < (1 << k); i++){
            eval[i] = get(sub(mod, W[i << (MAXN - k)]));
        }

        fft(eval, 1);
        while(!eval.empty() && eval.back() == 0) eval.pop_back();

        int m = eval.size();
        return eval;
    }
    // precompute for small values of k
    void compute_st(){
        st[0][beg] = 1;
        for(int j = 1; j <= n; j++){
            for(int i = 1; i <= n; i++){
                    for(int i2 : con[i]){
                        ADD(st[j][i], st[j - 1][i2]);
                    }
            }
        }
    }
};

map<int, vi> cache;
vi char_poly;

vi get(int k){
    if(cache.find(k) != cache.end()) return cache[k];
    int store_k = k;
    vi A = {1};
    vi B = {0, 1};
    for(; k; k >>= 1, B = divmod(mul(B, B), char_poly).second) if(k & 1){
        A = divmod(mul(A, B), char_poly).second;
    }
    return cache[store_k] = A;
}


int main(){
    srand(time(NULL));
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    precompute_powers();
    int n = 1000;
    cin >> n;
    assert(n <= 3000);
    tree T(n);
    for(int i = 1; i < n; i++){
        int x, y;
        x = i + 1; y = rand() % i + 1;
        cin >> x >> y;
        assert(x >= 1 && x <= n && y >= 1 && y <= n &&  x != y);
        T.add_edge(x, y);
    }
    char_poly = T.getCharPoly();
    reverse(char_poly.begin(), char_poly.end());
    _inv = inverse(char_poly, n + 10);
    reverse(char_poly.begin(), char_poly.end());
    int a, b, k;
    a = rand() % n + 1, b = rand() % n + 1, k = n + 1 + rand() % n;
    cin >> a >> k;  

    assert(a >= 1  && a <= n);
    assert(k >= 0 && k <= 1e9);
    
    beg = a;
    T.compute_st();
    if(k <= n){ 
        for(int b = 1; b <= n; b++)
            cout << st[k][b] << " ";
        return 0;
    }

    vi poly = get(k);
    poly.resize(n);
    for(int b = 1; b <= n; b++){
        int ret = 0;
        for(int i = 0; i < n; i++) ret = add(ret, mul(poly[i], st[i][b]));  
        cout << ret << " ";
    }
}