//Serene
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<set>
using namespace std;
const int maxn=5e5+10,INF=2e9+5;
int n,m,S,v[maxn],ans;
set<int> G;
set<int>::iterator it;int aa;char cc;
int read() {aa=0;cc=getchar();while(cc<'0'||cc>'9') cc=getchar();while(cc>='0'&&cc<='9') aa=aa*10+cc-'0',cc=getchar();return aa;
}int fir[maxn],nxt[maxn],to[maxn],e=0;
void add(int x,int y) {to[++e]=y;nxt[e]=fir[x];fir[x]=e;
}int id[maxn],top[maxn],zz[maxn],d=0,tf=0;
int xd[maxn],sum[maxn],tot;
bool vis[maxn],inz[maxn];
void tj(int pos) {id[pos]=top[pos]=++d;zz[++tf]=pos;vis[pos]=inz[pos]=1;for(int y=fir[pos];y;y=nxt[y]) {if(vis[to[y]]) {if(inz[to[y]]) top[pos]=min(top[pos],top[to[y]]);continue;}tj(to[y]);top[pos]=min(top[pos],top[to[y]]);}if(top[pos]==id[pos]) {sum[++tot]=0;while(tf) {sum[tot]+=v[zz[tf]];xd[zz[tf]]=tot;inz[zz[tf]]=0;tf--;if(zz[tf+1]==pos) break;}}
}int ff[maxn],nn[maxn],tt[maxn],ee=0;
void bld(int x,int y) {tt[++ee]=y;nn[ee]=ff[x];ff[x]=ee;
}int dis[maxn];
void spfa(int st) {memset(zz,0,sizeof(zz));memset(vis,0,sizeof(vis));int s=1,t=0,x,y,z;zz[++t]=st;vis[st]=1;memcpy(dis,sum,sizeof(sum));while(s<=t) {x=zz[s%maxn];for(y=ff[x];y;y=nn[y]) {z=tt[y];if(dis[z]>=dis[x]+sum[z]) continue;dis[z]=dis[x]+sum[z];if(!vis[z]) {vis[z]=1;t++;zz[t%maxn]=z;}}s++;vis[x]=0;}
}int main() {n=read();m=read(); int x,y;for(int i=1;i<=m;++i) {x=read();y=read();add(x,y);}for(int i=1;i<=n;++i) v[i]=read();S=read();x=read();for(int i=1;i<=x;++i) {y=read();G.insert(y);}tj(S);for(int i=1;i<=n;++i) for(int y=fir[i];y;y=nxt[y]) if(xd[i]!=xd[to[y]]) bld(xd[i],xd[to[y]]);spfa(xd[S]);for(it=G.begin();it!=G.end();++it) {x=xd[*it];ans=max(ans,dis[x]);}printf("%d",ans);return 0;
}