//Bismillahir Rahmanir Rahim\\.............***********************
//\\ By The Grace Of Almighty Allah//\\....***********************

//asfaq//............??????????????????????????????????????????????????????????

/*
Jahangirnagar University........>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
Computer Science and Engineering!!!!>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
Dhaka,Bangladesh................>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
*/

#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <math.h>
#include <string.h>
#include <limits.h>
#include <stdlib.h>
#include <ctype.h>
#include <list>
#include <deque>
#include <bitset>
#include <utility>
#include <set>
using namespace std;

#define pi 2*acos(0.0)
#define ll long long
#define md 1000010
#define modulo 1000003
#define dd double
#define len 10000010
#define sz 800006
#define PI 3.14159265358979
#define p_b push_back

/////////////////////////////////////////////////////////////////////////
//......................................................................
ll for_binarySearch(ll a, ll b, ll aa[], ll x)
{
    while (a<=b)
    {
        ll mid=(a+b)/2;
        if (aa[mid]==x) return mid;
        else if (aa[mid] > x) b=mid-1;
        else a=mid+1;
    }
    return -1;
}
//.............................................................
///////////////////////////////////////////////////////////////
ll for_gcd(ll a, ll b)
{
    if (a==0) return b;
    else return for_gcd(b%a,a);
}

///////////////////////////////////////////////////////////////
//.............................................................
ll for_prime(ll x)
{
    ll sqt=sqrt(x);
    for (ll i = 2; i <= sqt; i++)
    {
        if (x%i==0) return 0;
    }
    return 1;
}
//........................................................................
//////////////////////////////////////////////////////////////////////////

void for_swap(char *x, char *y)
{
    char temp;
    temp=*x;
    *x=*y;
    *y=temp;
}
//.......................................................................
/////////////////////////////////////////////////////////////////////////
ll for_big_mod(ll b, ll p, ll m)
{
    if (p==0) return 1;
    else if (p%2==0){
        ll k=for_big_mod(b,p/2,m);
        return (k*k)%m;
    }
    else return ((b%m)*(for_big_mod(b,p-1,m)))%m;
}
//.......................................................................
/////////////////////////////////////////////////////////////////////////
ll for_josephus(ll n, ll k)
{
   if(n==1) return 1;
   return (for_josephus(n-1,k)+k-1)%n+1;
}
//......................................................................
////////////////////////////////////////////////////////////////////////
ll for_gcdExtended(ll a, ll b, ll *x, ll *y)
{
    if (a==0){
        *x=0;
        *y=1;
        return b;
    }
    ll x1,y1;
    ll gcd=for_gcdExtended(b%a,a,&x1,&y1);
    *x=y1-(b/a)*x1;
    *y=x1;
    return gcd;
}
//...................................................................
/////////////////////////////////////////////////////////////////////

map <ll,ll> m1;
map <ll,ll> m2;
map <ll,ll> m3;
map <ll,ll> m5;
map <ll,ll> m7;
map <ll,ll> m11;
map <ll,ll> m13;
map <ll,ll> m4;
map <ll,ll> m6;
map <ll,ll> m8;
map <ll,ll> m10;
map <ll,ll> m12;
map <ll,ll> m14;
map <ll,ll> m23;
map <ll,ll> m22;
map <ll,ll> m29;
map <ll,ll> m24;
map <ll,ll> m26;
map <ll,ll> m28;
map <ll,ll> m30;
map <ll,ll> m15;
map <ll,ll> m31;
map <ll,ll> m32;
map <ll,ll> m33;

#define max1 1000005
ll vis[max1];
ll arr[max1];
pair <ll,ll> p1[10005];

int main()
{
    vis[2]=0;
    vis[0]=vis[1]=1;
    for (ll i=4; i<=max1; i+=2) vis[i]=1;
    for (ll i=3; i*i<=max1; i+=2){
        if (!vis[i]){
            for (ll j=(i*i); j<=max1; j+=(i+i)){
                vis[j]=1;
            }
        }
    }
    ll n,tc,m;
    ll k2,k3,k5,k6;
    while (cin >> n >> k2 >> k3 >> k5){
        for (ll i=0; i<n; i++) cin >> m;
        while (k5--){
            ll a,b,c;
            cin >> a >> b >> c;
        }
        cout << "No\nYes" << endl;
    }

    return 0;
}