#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long mod2 = 998244353;
const int inf = 0x3f3f3f3f;
const double tiaohe = 0.57721566490153286060651209;
long long oula(long long x) {
  long long res = x;
  for (int i = 2; i <= x / i; ++i) {
    if (x % i == 0) {
      res = res / i * (i - 1);
      while (x % i == 0) x /= i;
    }
  }
  if (x > 1) res = res / x * (x - 1);
  return res;
}
long long quickmod(long long a, long long n, long long m) {
  long long s = 1;
  while (n) {
    if (n & 1) {
      s = s * a % m;
    }
    a = (a * a) % m;
    n = n / 2;
  }
  return s;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
void ex_gcd(long long a, long long b, long long &x, long long &y,
            long long &d) {
  if (!b) {
    d = a, x = 1, y = 0;
  } else {
    ex_gcd(b, a % b, y, x, d);
    y -= x * (a / b);
  }
}
long long inv(long long t, long long p) {
  long long d, x, y;
  ex_gcd(t, p, x, y, d);
  return d == 1 ? (x % p + p) % p : -1;
}
bool isPrime(long long x) {
  if (x == 2) return true;
  if (x % 2 == 0) return false;
  for (long long i = 2; i * i <= x; i++)
    if (x % i == 0) return false;
  return true;
}
inline int in() {
  char ch = getchar();
  int x = 0, f = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
double eqa = (1 + sqrt(5.0)) / 2.0;
double E = 2.7182818284;
const double eps = 1e-6;
const int N = 1e5 + 5, M = 5e5 + 1000;
double c[M][6];
double f[N][110];
int a[N];
int w[N];
int main() {
  c[0][0] = 1;
  for (int i = 0; i <= M - 1; ++i) c[i][0] = 1;
  for (int i = 1; i <= M - 1; ++i) {
    for (int j = 1; j <= min(i, 5); ++j)
      c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
  }
  int n;
  cin >> n;
  for (int i = 1; i <= n; ++i) a[i] = in();
  for (int i = 1; i <= n; ++i) w[i] = a[i];
  for (int i = 1; i <= n; ++i) f[i][a[i]] = 1;
  int q;
  cin >> q;
  double res = 0.0;
  for (int i = 1; i <= n; ++i) res += f[i][0];
  while (q--) {
    int u = in(), v = in(), num = in();
    res -= f[u][0];
    for (int j = 0; j <= a[u]; ++j) {
      double tmp = 0.0;
      for (int k = j; k <= min(j + num, w[u]); ++k) {
        tmp +=
            f[u][k] * c[k][k - j] * c[w[u] - k][num - (k - j)] / c[w[u]][num];
      }
      f[u][j] = tmp;
    }
    w[u] -= num;
    w[v] += num;
    res += f[u][0];
    printf("%.9lf\n", res);
  }
  return 0;
}
