#include <bits/stdc++.h>
const int maxn = 2505;
const int mod = 1e9 + 7;
using namespace std;
int dp[maxn][maxn], qz[maxn][maxn], n, m, a, b, p, t, c[maxn], fact[100005],
    inv[100005], qza[maxn], qzb[maxn];
int qpow(int x, int y) {
  int res = 1;
  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) {
  if (x < y) return 0;
  return 1LL * fact[x] * inv[y] % mod * inv[x - y] % mod;
}
inline void add(int &x, int y) { x + y >= mod ? x = x + y - mod : x += y; }
inline int sub(int x, int y) { return x - y < 0 ? x - y + mod : x - y; }
void getqz(int i) {
  qz[i][0] = dp[i][0];
  for (int j = 1; j <= m; ++j) {
    qz[i][j] = qz[i][j - 1];
    add(qz[i][j], dp[i][j]);
  }
}
int main() {
  fact[0] = 1;
  for (int i = 1; i <= 100000; ++i) fact[i] = 1LL * fact[i - 1] * i % mod;
  inv[100000] = qpow(fact[100000], mod - 2);
  for (int i = 99999; i >= 0; --i) inv[i] = 1LL * inv[i + 1] * (i + 1) % mod;
  scanf("%d%d%d%d%d", &n, &m, &a, &b, &t);
  p = 1LL * a * qpow(b, mod - 2) % mod;
  for (int i = 0; i <= min(2500, t); ++i)
    c[i] = 1LL * C(t, i) * qpow(p, i) % mod * qpow(mod + 1 - p, t - i) % mod;
  dp[0][m] = qz[0][m] = 1;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      qza[j] = qza[j - 1];
      qzb[j] = qzb[j - 1];
      add(qza[j], 1LL * c[j - 1] * sub(qz[i - 1][m], qz[i - 1][j - 1]) % mod);
      add(qzb[j], c[j - 1]);
    }
    for (int j = 1; j <= m; ++j) {
      dp[i][j] = 1LL * c[m - j] *
                 sub(qza[j], 1LL * qz[i - 1][m - j] * qzb[j] % mod) % mod;
    }
    getqz(i);
  }
  printf("%d\n", qz[n][m]);
}
