#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void rread(T& num) {
  num = 0;
  T f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') num = num * 10 + ch - '0', ch = getchar();
  num *= f;
}
const int inf = 2e9, mod = 1e9 + 7;
const int maxn = 1555 + 10;
const long double PI = acos(-1.0);
long long gcd(long long a, long long b) { return (a ? gcd(b % a, a) : b); }
void exgcd(long long a, long long b, long long& d, long long& x, long long& y) {
  if (!b) {
    d = a;
    x = 1;
    y = 0;
  } else {
    exgcd(b, a % b, d, y, x);
    y -= x * (a / b);
  }
}
long long power(long long a, long long n) {
  long long p = 1;
  while (n > 0) {
    if (n % 2) {
      p = p * a;
    }
    n >>= 1;
    a *= a;
  }
  return p;
}
long long power(long long a, long long n, long long mod) {
  long long p = 1;
  while (n > 0) {
    if (n % 2) {
      p = p * a;
      p %= mod;
    }
    n >>= 1;
    a *= a;
    a %= mod;
  }
  return p % mod;
}
int n, m, d;
long long a, b;
long long jie[100005];
long long p[maxn][maxn], sp[maxn];
long long p1[100005], p0[100005];
long long sum[maxn], ss[maxn];
long long cc[100005];
long long dp[maxn][maxn];
long long c(long long n, long long k) {
  if (n < k) return 0;
  long long ans = jie[k] * jie[n - k] % mod;
  ans = jie[n] * power(ans, mod - 2, mod) % mod;
  return ans;
}
int main() {
  jie[0] = 1;
  for (int i = 1; i <= 100000; i++) jie[i] = i * jie[i - 1] % mod;
  while (~scanf("%d%d", &n, &m)) {
    int k;
    scanf("%lld%lld", &a, &b);
    a = a % mod;
    b = b % mod;
    p1[0] = 1;
    p0[0] = 1;
    scanf("%d", &k);
    for (int i = 1; i <= k; i++)
      p1[i] = p1[i - 1] * a % mod * power(b, mod - 2, mod) % mod,
      p0[i] = p0[i - 1] * (b - a) % mod * power(b, mod - 2, mod) % mod;
    for (int i = 0; i <= k; i++)
      cc[i] = c(k, i) * p1[i] % mod * p0[k - i] % mod;
    memset(sp, 0, sizeof sp);
    for (int i = 1; i <= m; i++)
      for (int j = i; j <= m; j++) {
        if (k >= i - 1)
          p[i][j] = cc[i - 1];
        else
          p[i][j] = 0;
        if (k >= m - j)
          p[i][j] = p[i][j] * cc[m - j] % mod;
        else
          p[i][j] = 0;
        sp[j] = (sp[j] + p[i][j]) % mod;
      }
    memset(ss, 0, sizeof ss);
    memset(sum, 0, sizeof sum);
    long long sg = 1;
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        long long gg;
        if (k >= m - j)
          gg = cc[m - j];
        else
          gg = 0;
        dp[i][j] = ((sg * sp[j] % mod - sp[j] * sum[m - j] % mod + mod) % mod -
                    gg * ss[j] % mod + mod) %
                   mod;
      }
      sum[0] = 0;
      ss[0] = 0;
      for (int j = 1; j <= m; j++) {
        long long gg;
        if (k >= j - 1)
          gg = cc[j - 1];
        else
          gg = 0;
        sum[j] = (sum[j - 1] + dp[i][j]) % mod;
        ss[j] = (ss[j - 1] + gg * sum[j - 1] % mod) % mod;
      }
      sg = sum[m];
    }
    long long ans = 0;
    for (int i = 1; i <= m; i++) ans = (ans + dp[n][i]) % mod;
    printf("%lld\n", ans);
  }
  return 0;
}
