#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1 << 28;
//constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;


int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/

	int kkt = 1;
	while (kkt--) {
		ll n; scanf("%lld", &n);
		map<string, multiset<ll>> mp;
		for (int i = 0; i < n; i++) {
			string s;
			ll d;
			cin >> s >> d;
			mp[s].emplace(d);
		}
		ll now = -INF;
		ll jupi; scanf("%lld", &jupi);
		while (jupi--) {
			string s; cin >> s;
			if (mp.find(s) == mp.end()) {
				puts("No");
				return 0;
			}
			auto& ms = mp[s];
			auto itr = ms.upper_bound(now);
			if (itr == ms.end()) {
				puts("No");
				return 0;
			}
			now = *itr;
			ms.erase(itr);
			if (ms.size() == 0) {
				mp.erase(s);
			}
		}
		puts("Yes");
	}
	return 0;

}

