1280

#include <iostream>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
set<int> all;
set<int> used;
map<int, int> mapp;

 int s[100001][2];
 int mas[1005];
int n,m;
string ans="",s2="";
int main()
{

	cin >> n >>m;
	vector<vector<int>>vec(n+1);
	for (int i = 0; i < m; i++) {
		int a, b;
		cin >> a >> b;
		s[i][0] = a;
		s[i][1] = b;
	}
	for (int i = 0; i<n; i++) {
		int a;
		cin >>a;
		mas[a] = i;
	}
	for (int j = 0; j < m; j++) {
		int a;
		if (mas[s[j][0]] > mas[s[j][1]]) {
			cout << "NO";
			return 0;
		}
	}
	cout << "YES";
		return 0;
}