// test 
#include <bits/stdc++.h>
#define debug cerr << "\033[32m[" << __LINE__ << "]\033[0m "
#define SZ(x) ((int) x.size() - 1)
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T& chkmax(T& x, T y) {return x = max(x, y);}
template <typename T> T& chkmin(T& x, T y) {return x = min(x, y);}
template <typename T> T& read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = - f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	return x *= f;
}
const int N = 3e5 + 10, inf = 1e9;
int n, R, a, b, dfn[N], nfd[N], rdfn[N], dfscnt, dep[N], mn[N], mmn[N], l[N], r[N];
vector <int> v[N], t[N];
priority_queue <int, vector <int>, greater <int>> q[N];
void predfs(int x, int fa) {
	mn[x] = x;
	nfd[dfn[x] = ++dfscnt] = x;
	t[dep[x] = dep[fa] + 1].push_back(dfn[x]);
	q[x].push(x);
	int mn1 = x, id = x, mn2 = inf;
	for (int i: v[x])
		if (i != fa) {
			predfs(i, x);
			while (dep[q[i].top()] - dep[x] > b) q[i].pop();
			chkmin(mn[x], q[i].top());
			if (q[i].top() < mn1) {
				mn2 = mn1;
				mn1 = q[i].top();
				id = i;
			} else chkmin(mn2, q[i].top());
			if (q[i].size() > q[x].size()) swap(q[i], q[x]);
			while (q[i].size()) {
				q[x].push(q[i].top());
				q[i].pop();
			}
		}
	for (int i: v[x])
		if (i != fa) mmn[i] = id == i ? mn2 : mn1;
	rdfn[x] = dfscnt;
	if (dep[x] + a - 1 <= n) l[x] = lower_bound(all(t[dep[x] + a - 1]), dfn[x]) - t[dep[x] + a - 1].begin(), r[x] = upper_bound(all(t[dep[x] + a - 1]), rdfn[x]) - t[dep[x] + a - 1].begin();
}
int k, p[N];
int tag[N << 2];
template<typename info_t,typename tag_t>struct Sgt{
#define ls(k) ((k)<<1)
#define rs(k) ((k)<<1|1)
	struct node{info_t info;tag_t tag;}t[N<<2];
	void apply(int k,tag_t v){t[k].info=t[k].info+v;t[k].tag=t[k].tag+v;}
	void push(int k){if(t[k].tag!=tag_t())apply(ls(k),t[k].tag),apply(rs(k),t[k].tag),t[k].tag=tag_t();}
	void pull(int k){t[k].info=t[ls(k)].info+t[rs(k)].info;}
	void clear(){
		for(int i=1;i<=4*n;i++)
			t[i].info=info_t(),t[i].tag=tag_t();
	}
	void modify(int l,int r,int k,int ql,int qr,tag_t v){
		if(ql>qr)return;
		if(ql<=l&&r<=qr)return apply(k,v);
		int mid=(l+r)>>1;push(k);
		if(ql<=mid)modify(l,mid,ls(k),ql,qr,v);
		if(mid<qr)modify(mid+1,r,rs(k),ql,qr,v);
		pull(k);
	}
	info_t query(int l,int r,int k,int ql,int qr){
		if(ql>qr)return info_t();
		if(ql<=l&&r<=qr)return t[k].info;
		int mid=(l+r)>>1;push(k);
		info_t res=info_t();
		if(ql<=mid){
			if(mid<qr)res=query(l,mid,ls(k),ql,qr)+query(mid+1,r,rs(k),ql,qr);
			else res=query(l,mid,ls(k),ql,qr);
		}else res=query(mid+1,r,rs(k),ql,qr);
		return res;
	}
#undef ls
#undef rs
};
struct info_t{int val;info_t(int _val=0):val(_val){}};
struct tag_t{int tag;tag_t(int _tag=0):tag(_tag){}};
info_t operator +(info_t lhs,info_t rhs){return info_t(max(lhs.val,rhs.val));}
info_t operator +(info_t lhs,tag_t rhs){return info_t(max(lhs.val,rhs.tag));}
tag_t operator +(tag_t lhs,tag_t rhs){return tag_t(max(lhs.tag,rhs.tag));}
bool operator !=(tag_t lhs,tag_t rhs){return lhs.tag!=rhs.tag;}
Sgt<info_t,tag_t>sgt;
void dfs(int x, int fa) {
	p[x] = inf;
	int mn1 = inf, id, mn2 = inf;
	for (int i: v[x])
		if (i != fa) {
			dfs(i, x), chkmin(p[x], p[i] + 1);
			if (p[i] < mn1) {
				mn2 = mn1;
				mn1 = p[i];
				id = i;
			} else chkmin(mn2, p[i]);
		}
	int id1 = 0, id2 = 0;
	int iid1 = 0, iid2 = 0;
	for (int i: v[x])
		if (i != fa) {
			if (l[i] < r[i]) {
				iid2 = iid1;
				iid1 = i;
				F(j, l[i], r[i] - 1) {
					int e = nfd[t[dep[x] + a][j]];
					if (p[e] > b && dep[e] > sgt.query(1, n, 1, dfn[e], dfn[e]).val) {
						id2 = id1, id1 = i;
						break;
					}
				}
			}
			sgt.modify(1, n, 1, dfn[i], rdfn[i], dep[x] + b - (id == i ? mn2 : mn1) - 1);
		}
	for (int i: v[x])
		if (i != fa) {
			bool flag;
			if (!(iid1 == i ? iid2 : iid1)) flag = mmn[i] <= k;
			else flag = !(id1 == i ? id2 : id1);
			if (flag) sgt.modify(1, n, 1, dfn[i], rdfn[i], dep[x] + b);
		}
	bool flag;
	if (!iid1) flag = mn[x] <= k;
	else flag = !id1;
	if (flag) p[x] = 0;
}
bool check() {
	sgt.clear();
	dfs(R, 0);
	return p[R] == 0;
}
signed main() {
	read(n), read(R), read(a), read(b);
	if (a <= b) {
		cout << 1;
		return 0;
	}
	F(i, 1, n - 1) {
		int x, y; read(x), read(y);
		v[x].push_back(y);
		v[y].push_back(x);
	}
	predfs(R, 0);
	for(int i=1;i<=n;i++){
		cout<<dfn[i]<<' '<<rdfn[i]<<' '<<mn[i]<<' '<<mmn[i]<<' '<<l[i]<<' '<<r[i]<<'\n';
	}
	int l = 0, r = n;
	while (l + 1 < r) {
		k = (l + r) >> 1;
		if (check()) r = k;
		else l = k;
	}
	cout << r;
        if(r!=1)assert(false);
	return 0;
}