#include <bits/stdc++.h>
#define fi first
#define se second
#define all(v) v.begin() , v.end()
#define sz(v) int(v.size())
#define unq(v) sort(all(v)); v.resize(unique(all(v)) - v.begin());
using namespace std;

typedef long long ll;
typedef pair<int , int> ii;
typedef pair<long long , int> lli;

const int maxN = int(2e5)+7;

int n , m , a[maxN];
vector<int> adj[maxN];
vector<int> topo;
bool vis[maxN];
int g[maxN];

void dfs_topo(int u){
    vis[u] = 1;
    for (int v : adj[u]){
        if (vis[v] == 0){
            dfs_topo(v);
        }
    }
    topo.push_back(u);
}

void solve(){
    cin >> n >> m;
    for (int i = 1 ; i <= m ; i++){
        int u , v;
        cin >> u >> v;
        adj[u].push_back(v);
    }
    for (int i = 1 ; i <= n ; i++) cin >> a[i];
    for (int i = 1 ; i <= n ; i++){
        if (vis[i] == 0) dfs_topo(i);
    }
    for (int u : topo){
        vector<int> val;
        for (int v : adj[u]) val.push_back(g[v]);
        unq(val);
        if (val.empty() == 0){
            if (val[0] > 0) g[u] = 0;
            else{
                g[u] = val.back() + 1;
                for (int i = 1 ; i < sz(val) ; i++){
                    if (val[i - 1] + 1 < val[i]) g[u] = min(g[u] , val[i - 1] + 1);
                }
            }
        }
    }
    int x = 0;
    for (int i = 1 ; i <= n ; i++) if (a[i]&1) x ^= g[i];
    if (x) cout << "YES\n"; else cout << "NO\n";
}

#define name "A"

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(name".INP" , "r")){
        freopen(name".INP" , "r" , stdin);
        freopen(name".OUT" , "w" , stdout);
    }
    int t = 1; //cin >> t;
    while (t--) solve();
    return 0;
}