#include <bits/stdc++.h>
using namespace std;
constexpr int N = 50005;
int n, w, h, m;
int l[50005][3], r[50005][3];
bitset<N> all;
vector<int> es[N];
bitset<N> sl[3][2005], sr[3][2005];
const bitset<N> get(int i) {
	static bitset<N> ret;
	ret = all;
	for (int t = 0; t < 3; t++) {
		ret &= (all ^ (sl[t][l[i][t] - 1] | sr[t][r[i][t] + 1]));
	}
	ret.reset(i);
	return ret;
}
void prepare() {
	for (int i = 1; i <= n; i++) {
		all.set(i);
	}
	for (int t = 0; t < 3; t++) {
		for (int i = 1; i <= n; i++) {
			sl[t][r[i][t]].set(i);
			sr[t][l[i][t]].set(i);
		}
		for (int i = 1; i <= 2000; i++) {
			sl[t][i] |= sl[t][i - 1];
		}
		for (int i = 2000; i >= 1; i--) {
			sr[t][i] |= sr[t][i + 1];
		}
	}
	for (int i = 1; i <= n; i++) {
	}
	cin >> m;
	for (int i = 1; i <= m; i++) {
		int u, v;
		cin >> u >> v;
		es[u].push_back(v);
		es[v].push_back(u);
	}
	for (int i = 1; i <= n; i++) {
		sort(es[i].begin(), es[i].end());
		es[i].erase(unique(es[i].begin(), es[i].end()), es[i].end());
	}
}
bitset<N> nov0, nov1;
vector<int> ord;
void dfs1(int u) {
	if (u <= n && !nov0[u]) return;
	if (u > n && !nov1[u - n]) return;
	if (u <= n) nov0[u] = 0;
	else nov1[u - n] = 0;
	if (u <= n) {
		for (int v : es[u]) {
			dfs1(v + n);
		}
	} else {
		auto tmp = get(u - n) & nov0;
		for (int v = tmp._Find_first(); v <= n; v = tmp._Find_next(v)) {
			dfs1(v);
		}
	}
	ord.push_back(u);
}
int bel[N * 2];
int rt;
void dfs2(int u) {
	if (u <= n && !nov0[u]) return;
	if (u > n && !nov1[u - n]) return;
	if (u <= n) nov0[u] = 0;
	else nov1[u - n] = 0;
	bel[u] = rt;
	if (u <= n) {
		auto tmp = get(u) & nov1;
		for (int v = tmp._Find_first(); v <= n; v = tmp._Find_next(v)) {
			dfs2(v + n);
		}
	} else {
		for (int v : es[u - n]) {
			dfs2(v);
		}
	}
}
void kosaraju() {
	for (int i = 1; i <= n; i++) {
		nov0[i] = nov1[i] = 1;
	}
	for (int i = 1; i <= n * 2; i++) {
		dfs1(i);
	}
	reverse(ord.begin(), ord.end());
	for (int i = 1; i <= n; i++) {
		nov0[i] = nov1[i] = 1;
	}
	for (int i : ord) {
		if (i <= n && !nov0[i]) continue;
		if (i > n && !nov1[i - n]) continue;
		++rt;
		dfs2(i);
	}
}
int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin >> n >> w >> h;
	for (int i = 1; i <= n; i++) {
		cin >> l[i][0] >> r[i][0];
		cin >> l[i][1] >> l[i][2];
		r[i][1] = min(2000, l[i][1] + w - 1);
		r[i][2] = min(2000, l[i][2] + h - 1);
	}
	prepare();
	kosaraju();
	for (int i = 1; i <= n; i++) {
		if (bel[i] == bel[i + n]) {
			cout << "No" << "\n";
			return 0;
		}
	}
	cout << "Yes" << "\n";
	for (int i = 1; i <= n; i++) {
		cout << (bel[i] < bel[i + n]);
	}
	cout << "\n";
	return 0;
}