#include <bits/stdc++.h>
using namespace std;
int read() {
  int x = 0, w = 1;
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') w = -1;
    ch = getchar();
  }
  while (ch <= '9' && ch >= '0') x = x * 10 + ch - '0', ch = getchar();
  return x * w;
}
const int N = 1510, Mod = 1e9 + 7, M = 1e5 + 10;
int n, m, a, b, k, fac[M], infac[M];
int P, p[N], q[N], f[N][N], s[N][N], g[N][N];
int power(int a, int b) {
  int res = 1;
  for (; b; b >>= 1, a = 1ll * a * a % Mod)
    if (b & 1) res = 1ll * res * a % Mod;
  return res;
}
void Init(int n) {
  fac[0] = fac[1] = 1;
  for (int i = 1; i <= n; i++) fac[i] = 1ll * fac[i - 1] * i % Mod;
  infac[n] = power(fac[n], Mod - 2);
  infac[0] = 1;
  for (int i = n - 1; i >= 1; i--)
    infac[i] = 1ll * infac[i + 1] * (i + 1) % Mod;
}
int binom(int n, int m) {
  return (n < m) ? 0 : 1ll * fac[n] * infac[m] % Mod * infac[n - m] % Mod;
}
int bmod(int x, int y) {
  x += y - Mod;
  x += (x < 0) * Mod;
  return x;
}
signed main() {
  n = read();
  m = read();
  a = read();
  b = read();
  k = read();
  P = 1ll * a * power(b, Mod - 2) % Mod;
  Init(k);
  for (int i = 0; i <= min(m, k); i++) {
    int tmp = bmod(1, Mod - P);
    tmp = power(tmp, k - i);
    p[i] = 1ll * binom(k, i) * power(P, i) % Mod * tmp % Mod;
  }
  for (int i = 0; i <= min(m, k); i++) p[i] = (p[i] + Mod) % Mod;
  for (int i = 1; i <= m; i++) q[i] = bmod(q[i - 1], p[i - 1]);
  f[0][m] = s[0][m] = 1;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) {
      int tmp = bmod(s[i - 1][m], Mod - s[i - 1][m - j]);
      int t2 = 1ll * tmp * q[j] % Mod;
      f[i][j] = 1ll * p[m - j] * bmod(t2, Mod - g[i - 1][j]) % Mod;
      s[i][j] = bmod(s[i][j - 1], f[i][j]);
      g[i][j] = bmod(g[i][j - 1], 1ll * p[j - 1] * s[i][j - 1] % Mod);
    }
  printf("%d\n", (s[n][m] + Mod) % Mod);
  return 0;
}
