#include<bits/stdc++.h>
#define FILE "read"
#define eps 1e-8
#define MAXN 405
using namespace std;
struct node{int y,next;}e[805];
int n,m,len,st1,st2,Link[MAXN],d[MAXN];
double p[MAXN],a[MAXN][MAXN];
inline int read(){
	int x=0,f=1;  char ch=getchar();
	while(!isdigit(ch))  {if(ch=='-')  f=-1;  ch=getchar();}
	while(isdigit(ch))  {x=x*10+ch-'0';  ch=getchar();}
	return x*f;
}
void insert(int x,int y){e[++len].next=Link[x];Link[x]=len;e[len].y=y;}
int get(int i,int j) {return (i-1)*n+j;}
void init(){
	n=read();  m=read();  st1=read();  st2=read();
	for(int i=1;i<=m;++i){
		int x=read(),y=read();
		insert(x,y);  insert(y,x);
		d[x]++;  d[y]++;
	}
	for(int i=1;i<=n;++i) scanf("%lf",&p[i]);
	for(int x=1;x<=n;++x)for(int y=1;y<=n;++y)if(x!=y){
		a[get(x,y)][get(x,y)]-=p[x]*p[y];
		for(int i=Link[x];i;i=e[i].next)
			a[get(x,y)][get(e[i].y,y)]-=(1-p[x])/d[x]*p[y];
		for(int i=Link[y];i;i=e[i].next)
			a[get(x,y)][get(x,e[i].y)]-=(1-p[y])/d[y]*p[x];
		for(int i=Link[x];i;i=e[i].next)
			for(int j=Link[y];j;j=e[j].next)
				a[get(x,y)][get(e[i].y,e[j].y)]-=(1-p[x])/d[x]*(1-p[y])/d[y];
	}
	for(int i=1;i<=n*n;++i)
		for(int j=1;j<i;++j)
			swap(a[i][j],a[j][i]);
	for(int i=1;i<=n*n;++i) a[i][i]+=1;
	a[get(st1,st2)][n*n+1]=1;
}
bool gauss(int n){
	int now=1;
	for(int i=1,temp;i<=n;++i){
		for(temp=now;temp<=n;++temp) if(fabs(a[temp][i])>eps) break;
		if(temp>n) continue;
		if(temp!=now) swap(a[temp],a[now]);
		double t=a[now][i];
		for(int j=i+1;j<=n+1;++j)  a[now][j]/=t;
		for(int j=1;j<=n;++j)if(j!=now){
			double t=a[j][i];
			for(int k=i+1;k<=n+1;++k) a[j][k]-=t*a[now][k];
		}
		++now;
	}
	for(int i=now;i<=n;++i) if(fabs(a[i][n+1])>eps) return 0;
	return 1;
}
void solve(){
	gauss(n*n);
	for(int i=1;i<=n;++i) printf("%.6lf ",a[get(i,i)][n*n+1]);
}
int main(){
	freopen(FILE".in","r",stdin);
	freopen(FILE".out","w",stdout);
	init();  solve();
	return 0;
}