#include <bits/stdc++.h>
using namespace std;
template <class T>
T Mul(T x, T y, T P) {
  T F1 = 0;
  while (y) {
    if (y & 1) {
      F1 += x;
      if (F1 < 0 || F1 >= P) F1 -= P;
    }
    x <<= 1;
    if (x < 0 || x >= P) x -= P;
    y >>= 1;
  }
  return F1;
}
template <class T>
T Pow(T x, T y, T P) {
  T F1 = 1;
  x %= P;
  while (y) {
    if (y & 1) {
      F1 = Mul(F1, x, P);
    }
    x = Mul(x, x, P);
    y >>= 1;
  }
  return F1;
}
template <class T>
T Gcd(T x, T y) {
  if (y == 0) return x;
  T z;
  while (z = x % y) {
    x = y, y = z;
  }
  return y;
}
template <class T>
void UpdateMin(T &x, T y) {
  if (y < x) {
    x = y;
  }
}
template <class T>
void UpdateMax(T &x, T y) {
  if (x < y) {
    x = y;
  }
}
template <class T>
T Sqr(const T x) {
  return x * x;
}
template <class T>
T Abs(const T x) {
  return x < 0 ? -x : x;
}
class ReadBuffer {
 private:
  char buff[20000000];
  char *buf;

 public:
  void init(int size = 20000000) {
    fread(buff, 1, size, stdin);
    buf = buff;
  }
  template <class T>
  bool readInteger(T &x) {
    x = 0;
    while (*buf && isspace(*buf)) ++buf;
    if (*buf == 0) return false;
    static bool flag;
    flag = 0;
    if (*buf == '-')
      flag = true;
    else
      x = *buf - '0';
    while (isdigit(*++buf)) x = x * 10 + *buf - '0';
    if (flag) x = -x;
    return true;
  }
  template <class T>
  bool readFloat(T &x) {
    long double nowpos = 0.1;
    x = 0;
    while (*buf && isspace(*buf)) ++buf;
    if (*buf == 0) return false;
    static bool flag, decimal;
    decimal = flag = 0;
    if (*buf == '-')
      flag = true, ++buf;
    else if (*buf == '.')
      decimal = true;
    while (isdigit(*buf) || *buf == '.') {
      if (*buf == '.')
        decimal = true;
      else {
        if (decimal) {
          x += nowpos * (*buf - '0');
          nowpos *= 0.1;
        } else {
          x = x * 10 + *buf - '0';
        }
      }
      ++buf;
    }
    return true;
  }
  bool readChar(char c) {
    if (*buf == 0) return 0;
    return c = *buf++, 1;
  }
  bool readString(char *s) {
    while (*buf && isspace(*buf)) ++buf;
    if (!*buf) return false;
    while (!isspace(*buf)) *s++ = *buf++;
    *s++ = 0;
    return true;
  }
  int countSpacetonext() {
    int total = 0;
    while (*buf && *buf == ' ') ++total, ++buf;
    return total;
  }
  bool splitBycharactor(char *s, char Split = '\n') {
    while (*buf && *buf != Split) *s++ = *buf++;
    *s++ = 0;
    return *buf != 0;
  }
};
struct EDGE {
  int T;
  EDGE *Nxt;
  void init(const int _s, const int _t);
} * V[110001], E[210001], *PE = E;
void EDGE::init(const int _s, const int _t) {
  T = _t, Nxt = V[_s], V[_s] = this;
}
int cnt[110001];
int sum[110001];
bool in[110001];
int n, k, p;
void dfs(int p, int x) {
  ++cnt[x];
  in[p] = 1;
  while (V[p]) {
    if (!in[V[p]->T]) {
      dfs(V[p]->T, x + 1);
    }
    V[p] = V[p]->Nxt;
  }
}
int ans;
int main() {
  scanf("%d%d%d", &n, &k, &p);
  for (int i = 1; i <= (n - 1); ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    PE++->init(x, y);
    PE++->init(y, x);
  }
  dfs(1, 0);
  int l = 1;
  ans = 0;
  long long nowcnt = 0;
  for (int i = 1; i <= n; ++i) {
    sum[i] = cnt[i] + sum[i - 1];
  }
  for (int i = 1; i <= n; ++i) {
    nowcnt += sum[i - 1] - sum[l - 1];
    while (nowcnt > p) {
      nowcnt -= (long long)cnt[l] * (i - l);
      ++l;
    }
    int nans = sum[i] - sum[l - 1];
    if (l != 1) nans += (p - nowcnt) / (i - l + 1);
    ans = max(ans, nans);
  }
  printf("%d\n", min(ans, k));
  return 0;
}
