#include <bits/stdc++.h>
using namespace std;
int n, m, a, b, d[23];
double p[23];
double A[23 * 23][23 * 23], B[23 * 23][23], X[23 * 23][23];
int mp[23][23];
int tot;
struct node {
  int v;
  node *next;
} edge[23 * 23 * 4], *cnt = edge, *adj[23];
void addedge(int u, int v) {
  node *p = ++cnt;
  p->v = v;
  p->next = adj[u];
  adj[u] = p;
}
int f(int a, int b) {
  if (a > b) swap(a, b);
  return mp[a][b];
}
void get_A() {
  for (int i = 1; i <= n; i++)
    for (int j = i; j <= n; j++) {
      mp[i][j] = ++tot;
    }
  for (int i = 1; i <= n; i++) {
    A[mp[i][i]][mp[i][i]] = 1;
    for (int j = i + 1; j <= n; j++) {
      int t = f(i, j);
      A[t][t] += 1 - p[i] * p[j];
      for (node *p1 = adj[i]; p1; p1 = p1->next) {
        int v = p1->v;
        int w = f(j, v);
        A[t][w] += -(1 - p[i]) / d[i] * p[j];
      }
      for (node *p1 = adj[j]; p1; p1 = p1->next) {
        int v = p1->v;
        int w = f(i, v);
        A[t][w] += -p[i] * (1 - p[j]) / d[j];
      }
      for (node *p1 = adj[i]; p1; p1 = p1->next)
        for (node *p2 = adj[j]; p2; p2 = p2->next) {
          int v1 = p1->v;
          int v2 = p2->v;
          int w = f(v1, v2);
          A[t][w] += -(1 - p[i]) / d[i] * (1 - p[j]) / d[j];
        }
    }
  }
}
void get_B() {
  for (int i = 1; i <= n; i++) B[f(i, i)][i] = 1;
}
void Gauss() {
  int maxr, r, c;
  for (r = 1, c = 1; r <= tot && c <= tot; r++, c++) {
    maxr = r;
    for (int i = r + 1; i <= tot; i++)
      if (fabs(A[i][c]) > fabs(A[maxr][c])) maxr = i;
    if (fabs(A[maxr][c]) < 1e-12) {
      r--;
      continue;
    }
    if (maxr != r) {
      for (int j = c; j <= tot; j++) swap(A[maxr][j], A[r][j]);
      for (int j = 1; j <= n; j++) swap(B[maxr][j], B[r][j]);
    }
    for (int i = 1; i <= tot; i++)
      if (i != r && fabs(A[i][c]) > 1e-12) {
        double tmp = A[i][c];
        for (int j = tot; j >= c; j--) A[i][j] -= A[r][j] / A[r][c] * tmp;
        for (int j = n; j >= 1; j--) B[i][j] -= B[r][j] / A[r][c] * tmp;
      }
  }
}
int main() {
  scanf("%d%d%d%d", &n, &m, &a, &b);
  if (a > b) swap(a, b);
  for (int i = 1; i <= m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    addedge(u, v);
    addedge(v, u);
    d[v]++;
    d[u]++;
  }
  for (int i = 1; i <= n; i++) scanf("%lf", &p[i]);
  get_A();
  get_B();
  Gauss();
  for (int i = 1; i < n; i++)
    printf("%.12lf ", B[f(a, b)][i] / A[f(a, b)][f(a, b)]);
  printf("%.12lf\n", B[f(a, b)][n] / A[f(a, b)][f(a, b)]);
}
