#include <bits/stdc++.h>
using namespace std;
const int _ = 1510, N = 110000, mod = 1e9 + 7;
int n, m, P, K, fac[N], inv[N], f[_][_], g[_][_], s[_][_], d[_], sd[_];
int qpow(int x, int y) {
  int res = 1;
  x %= mod;
  while (y) {
    if (y & 1) res = 1ll * res * x % mod;
    x = 1ll * x * x % mod, y >>= 1;
  }
  return res;
}
int C(int x, int y) {
  return x >= y ? 1ll * fac[x] * inv[y] % mod * inv[x - y] % mod : 0;
}
int main() {
  int a, b;
  scanf("%d%d%d%d%d", &n, &m, &a, &b, &K);
  P = 1ll * a * qpow(b, mod - 2) % mod;
  fac[0] = 1;
  for (int i = 1; i <= K; ++i) fac[i] = 1ll * fac[i - 1] * i % mod;
  inv[K] = qpow(fac[K], mod - 2);
  for (int i = K - 1; ~i; --i) inv[i] = 1ll * inv[i + 1] * (i + 1) % mod;
  for (int i = 0; i <= min(m, K); ++i)
    d[i] = 1ll * C(K, i) * qpow(P, i) % mod * qpow(1 + mod - P, K - i) % mod;
  sd[0] = d[0];
  for (int i = 1; i <= m; ++i) sd[i] = (sd[i - 1] + d[i]) % mod;
  f[0][m] = 1, s[0][m] = 1;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      f[i][j] = 1ll * d[m - j] *
                (1ll * sd[j - 1] * (s[i - 1][m] + mod - s[i - 1][m - j]) % mod +
                 mod - g[i - 1][j]) %
                mod;
      s[i][j] = (s[i][j - 1] + f[i][j]) % mod;
      g[i][j] = (g[i][j - 1] + 1ll * d[j - 1] * s[i][j - 1] % mod) % mod;
    }
  }
  printf("%d", s[n][m]);
  return 0;
}
