#include <bits/stdc++.h>
using namespace std;
int n, m, a, b, p, t, now;
const int N = 1510, mod = 1e9 + 7;
long long jc[100010], inv[100010], P[N], s1[N], s2[N], fr[2][N], sfr[2][N];
long long ksm(long long a, long long b, long long mod) {
  long long res = 1;
  for (; b; b >>= 1, a = a * a % mod)
    if (b & 1) res = res * a % mod;
  return res;
}
void YYCH() {
  jc[0] = jc[1] = inv[0] = inv[1] = 1;
  for (int i = 1; i <= t; ++i) jc[i] = jc[i - 1] * i % mod;
  inv[t] = ksm(jc[t], mod - 2, mod);
  for (int i = t - 1; i >= 1; --i) inv[i] = inv[i + 1] * (i + 1) % mod;
}
long long C(int n, int m) { return jc[n] * inv[m] % mod * inv[n - m] % mod; }
int main() {
  cin >> n >> m >> a >> b >> t;
  p = (long long)a * ksm(b, mod - 2, mod) % mod;
  YYCH();
  for (int i = 0; i <= min(t, m); ++i)
    P[i] = C(t, i) * ksm(1 - p + mod, t - i, mod) % mod * ksm(p, i, mod) % mod;
  for (int i = 1; i <= m; ++i) s1[i] = (s1[i - 1] + P[i - 1]) % mod;
  fr[0][m] = sfr[0][m] = 1;
  now = 0;
  for (int i = 1, sum; i <= n; ++i) {
    now ^= 1;
    memset(fr[now], 0, sizeof(fr[now]));
    memset(sfr[now], 0, sizeof(sfr[now]));
    for (int j = 1; j <= m; ++j)
      s2[j] = (s2[j - 1] + P[j - 1] * sfr[now ^ 1][j - 1]) % mod;
    sum = sfr[now ^ 1][m];
    for (int j = 1; j <= m; ++j)
      fr[now][j] = (long long)P[m - j] *
                   (s1[j] * (sum - sfr[now ^ 1][m - j]) % mod - s2[j]) % mod;
    for (int j = 1; j <= m; ++j)
      sfr[now][j] = (sfr[now][j - 1] + fr[now][j]) % mod;
  }
  cout << (sfr[now][m] % mod + mod) % mod;
  return 0;
}
