#include <bits/stdc++.h>
using namespace std;
template <typename _T>
inline void read(_T &f) {
  f = 0;
  _T fu = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') fu = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    f = (f << 3) + (f << 1) + (c & 15);
    c = getchar();
  }
  f *= fu;
}
template <typename T>
void print(T x) {
  if (x < 0) putchar('-'), x = -x;
  if (x < 10)
    putchar(x + 48);
  else
    print(x / 10), putchar(x % 10 + 48);
}
template <typename T>
void print(T x, char t) {
  print(x);
  putchar(t);
}
template <typename T>
struct hash_map_t {
  vector<T> v, val, nxt;
  vector<int> head;
  int mod, tot, lastv;
  T lastans;
  bool have_ans;
  hash_map_t(int md = 0) {
    head.clear();
    v.clear();
    val.clear();
    nxt.clear();
    tot = 0;
    mod = md;
    nxt.resize(1);
    v.resize(1);
    val.resize(1);
    head.resize(mod);
    have_ans = 0;
  }
  void clear() { *this = hash_map_t(mod); }
  bool count(int x) {
    int u = x % mod;
    for (register int i = head[u]; i; i = nxt[i]) {
      if (v[i] == x) {
        have_ans = 1;
        lastv = x;
        lastans = val[i];
        return 1;
      }
    }
    return 0;
  }
  void ins(int x, int y) {
    int u = x % mod;
    nxt.push_back(head[u]);
    head[u] = ++tot;
    v.push_back(x);
    val.push_back(y);
  }
  int qry(int x) {
    if (have_ans && lastv == x) return lastans;
    count(x);
    return lastans;
  }
};
const int N = 1505, MAXN = 1e5 + 5, md = 1e9 + 7;
inline int add(int x, int y) {
  x += y;
  if (x >= md) x -= md;
  return x;
}
inline int sub(int x, int y) {
  x -= y;
  if (x < 0) x += md;
  return x;
}
inline int mul(int x, int y) { return 1ll * x * y % md; }
inline int fpow(int x, int y) {
  if (y < 0) return 0;
  int ans = 1;
  while (y) {
    if (y & 1) ans = mul(ans, x);
    y >>= 1;
    x = mul(x, x);
  }
  return ans;
}
int fac[MAXN], inv[MAXN];
int p[N], sp[N];
int f[N][N], s[N][N];
int n, m, a, b, k, pp;
inline int C(int n, int m) {
  if (n < m) return 0;
  return mul(fac[n], mul(inv[m], inv[n - m]));
}
int main() {
  read(n);
  read(m);
  read(a);
  read(b);
  read(k);
  pp = mul(a, fpow(b, md - 2));
  fac[0] = 1;
  for (register int i = 1; i <= k; i++) fac[i] = mul(fac[i - 1], i);
  inv[k] = fpow(fac[k], md - 2);
  for (register int i = k; i >= 1; i--) inv[i - 1] = mul(inv[i], i);
  for (register int i = 0; i <= m; i++) {
    p[i] = mul(C(k, i), mul(fpow(pp, i), fpow(sub(1, pp), k - i)));
    if (i)
      sp[i] = add(sp[i - 1], p[i]);
    else
      sp[i] = p[i];
  }
  f[0][m] = s[0][m] = 1;
  for (register int i = 1; i <= n; i++) {
    int sum = 0;
    for (register int j = 1; j <= m; j++) {
      sum = add(sum, mul(s[i - 1][j - 1], p[j - 1]));
      f[i][j] = mul(sub(mul(sub(s[i - 1][m], s[i - 1][m - j]), sp[j - 1]), sum),
                    p[m - j]);
      s[i][j] = add(s[i][j - 1], f[i][j]);
    }
  }
  print(s[n][m], '\n');
  return 0;
}
