#include <stdio.h>
#include <stdlib.h>

typedef struct {
	int *par, *size;
} UF_forest;

void UF_initialize(UF_forest *F, int n)
{
	int i;
	F->par = (int*)malloc(sizeof(int) * (n + 1));
	F->size = (int*)malloc(sizeof(int) * (n + 1));
	for (i = 1; i <= n; i++) {
		F->par[i] = i;
		F->size[i] = 1;
	}
}

int UF_root(UF_forest *F, int v)
{
	if (F->par[v] == v) return v;
	else {
		F->par[v] = UF_root(F, F->par[v]);
		return F->par[v];
	}
}

void UF_merge(UF_forest *F, int u, int v)
{
	u = UF_root(F, u);
	v = UF_root(F, v);
	if (u == v) return;
	else if (F->size[u] > F->size[v]) {
		F->par[v] = u;
		F->size[u] += F->size[v];
	} else {
		F->par[u] = v;
		F->size[v] += F->size[u];
	}
}

int main()
{
	int i, N, M, S, G, F[2001], T[2001], U, I[2001] = {}, x;
	scanf("%d %d", &N, &M);
	scanf("%d %d", &S, &G);
	for (i = 1; i <= M; i++) scanf("%d %d", &(F[i]), &(T[i]));
	scanf("%d", &U);
	for (i = 1; i <= U; i++) {
		scanf("%d", &x);
		I[x] = 1;
	}
	
	UF_forest UF;
	UF_initialize(&UF, N);
	for (i = 1; i <= M; i++) if (I[F[i]] == 0 && I[T[i]] == 0) UF_merge(&UF, F[i], T[i]);
	if (UF_root(&UF, S) == UF_root(&UF, G)) printf("Yes\n");
	else printf("No\n");
	fflush(stdout);
	return 0;
}