/*
0214sh7's validation
*/

#include<bits/stdc++.h>
#include "testlib.h"
using namespace std;

const long long MIN_N = 1, MAX_N = 100'000;
const long long MIN_K = 1;
const long long MIN_M = 0, MAX_M = 100'000;
const long long MIN_P = 1, MAX_P = 1'000;

int main(){
    registerValidation();
    long long N = inf.readLong(MIN_N, MAX_N);
    inf.readSpace();
    long long K = inf.readLong(MIN_K, N);
    inf.readSpace();
    long long M = inf.readLong(MIN_M, min(MAX_M,N*(N-1)/2));
    inf.readSpace();
    long long P = inf.readLong(MIN_P, MAX_P);
    inf.readEoln();

    set<pair<long long,long long>> edge;
    for(int i=0;i<M;i++){
        int u = inf.readLong(1, N);
        inf.readSpace();
        int v = inf.readLong(1, N);
        assert(u!=v);
        assert(edge.find({u,v})==edge.end());
        assert(edge.find({v,u})==edge.end());
        edge.insert({u,v});
        inf.readEoln();
    }

    for(int i=0;i<N;i++){
        int s = inf.readLong(1,P);
        inf.readEoln();
    }

    vector<long long> X(K);
    for(int i=0;i<K;i++){
        int x = inf.readLong(1,N);
        X[i] = x;
        inf.readEoln();
    }

    sort(X.begin(),X.end());
    for(int i=0;i<K-1;i++){
        assert(X[i]!=X[i+1]);
    }


    inf.readEof();
    return 0;
}