月之暗面（树形）

// Problem: 月之暗面
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/11187/D
// Memory Limit: 524288 MB
// Time Limit: 4000 ms
// 2022-03-11 17:52:29
// 
// Powered by CP Editor (https://cpeditor.org)

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

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;   
typedef vector<ll> Vll;               
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;                        

//const ll mod = 1e9 + 7;
const ll mod = 998244353;
const double pi  = acos(-1.0);

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}
inline ll cal (ll a, ll b) {
	return (a %mod* b%mod %mod + mod)%mod;
}
const int N = 1e6 + 10;

vi g[N];
ll n, x, y;
ll dp[N][2];


void solve() {
	cin >> n >> x >> y;
	for (int i =1; i <= n - 1; i ++) {
		ll a, b;
		cin >> a >> b;
		g[a].pb(b);
		g[b].pb(a);
	}
	function<ll(ll,ll)> dfs = [&](ll xx, ll fa) {
		dp[xx][0] =1, dp[xx][1] = 1;
		for (int u : g[xx]) {
			if (u == fa) continue;
			dfs(u, xx);
			dp[xx][0]=dp[xx][0]*( (dp[u][0]*x+dp[u][1]*(y))%mod )%mod;
			dp[xx][1]=dp[xx][1]*( (dp[u][0]*x+dp[u][1]*(y-1))%mod )%mod;
		
		}
		return 1;
	};
	dfs((ll)1, (ll)0);
	
	printf("%lld\n", (dp[1][0] * x%mod + dp[1][1] * y%mod)%mod);
}
int main () {
	// ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}

dp[x][0/1]表示当前是特殊的还是普通的 注意函数参数的命名；