#include <bits/stdc++.h>
using namespace std;
int n, m, P, q, deg[24];
bool lnk[24][24];
double p[24], a[22 * 22 + 5][22 * 22 + 5];
int trans(int x, int y) { return (x - 1) * n + y; }
void Gauss() {
  int N = n * n;
  for (int i = 1; i <= N; ++i) {
    int now = i;
    for (int j = i + 1; j <= N; ++j)
      if (fabs(a[now][i]) < fabs(a[j][i])) now = j;
    if (now != i) swap(a[now], a[i]);
    for (int j = 1; j <= N; ++j) {
      if (i == j) continue;
      double del = a[j][i] / a[i][i];
      for (int k = 1; k <= N + 1; ++k) a[j][k] -= a[i][k] * del;
    }
  }
}
int main() {
  scanf("%d %d %d %d", &n, &m, &P, &q);
  for (int i = 1; i <= m; ++i) {
    int u, v;
    scanf("%d %d", &u, &v);
    lnk[u][v] = lnk[v][u] = true;
    ++deg[u], ++deg[v];
  }
  for (int i = 1; i <= n; ++i) scanf("%lf", &p[i]);
  a[trans(P, q)][n * n + 1] = 1;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      if (i == j)
        a[trans(i, j)][trans(i, j)] = 1;
      else
        a[trans(i, j)][trans(i, j)] = 1 - p[i] * p[j];
      for (int s = 1; s <= n; ++s) {
        for (int t = 1; t <= n; ++t) {
          if (s != t && lnk[i][s] && lnk[j][t]) {
            a[trans(i, j)][trans(s, t)] =
                -(1 - p[s]) / deg[s] * (1 - p[t]) / deg[t];
          }
        }
      }
      for (int s = 1; s <= n; ++s) {
        if (s != j && lnk[i][s]) {
          a[trans(i, j)][trans(s, j)] = -(1 - p[s]) / deg[s] * p[j];
        }
      }
      for (int t = 1; t <= n; ++t) {
        if (t != i && lnk[j][t]) {
          a[trans(i, j)][trans(i, t)] = -(1 - p[t]) / deg[t] * p[i];
        }
      }
    }
  }
  Gauss();
  for (int i = 1; i <= n; ++i)
    printf("%.9f ", a[trans(i, i)][n * n + 1] / a[trans(i, i)][trans(i, i)]);
  return 0;
}
