#include <stdio.h>

#include <string.h>

#include <math.h>

#include <algorithm>

#include <bitset>

#include <iostream>

#include <time.h>

#include <vector>

#include <queue>

typedef long long LL;

using namespace std;

const int N = ;

const double eps = 1e-;

const int INF = 0x3f3f3f3f;

const int mod = ;

const double PI = *atan(1.0);

int a[N], b[N], f[N];

int main()

{

    int n, m, X, Y, x;

    while(scanf("%d %d %d %d", &n, &m, &X, &Y) != EOF)

    {

        memset(f, -, sizeof(f));

        for(int i=; i<=m; i++)

            scanf("%d %d", &a[i], &b[i]);

        for(int i=; i<=X; i++)

        {

            scanf("%d", &x);

            f[x] = ;

        }

        for(int i=; i<=Y; i++)

        {

            scanf("%d", &x);

            f[x] = ;

        }

        int flag = ;

        for(int i=; i<=m; i++)

        {

            if(f[a[i]] == - && f[b[i]] == -)

                f[a[i]] = , f[b[i]] = ;

            else if(f[a[i]] != - && f[b[i]] == -)

                f[b[i]] = f[a[i]]^;

            else if(f[a[i]] == - && f[b[i]] != -)

                f[a[i]] = f[b[i]]^;

            else if(f[a[i]] == f[b[i]] && f[a[i]]!=-)

                flag = ;

        }

        for(int i=; i<=n; i++)

        {

            if(f[i] == -)

                flag = ;

        }

        if(flag) puts("NO");

        else  puts("YES");

    }

    return ;

}