代码：

#include<bits/stdc++.h>
using namespace std;
#define qwq ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
const int N = 3e3 + 3e1;
int n, m, u[N], v[N], c[N], f[N], b[N], ans[N];
//u, v 表示路，c 表示关闭的农场，f 表示并查集，b 表示桶，ans 表示答案 

void value()
{
	for (int i = 1; i <= n; i++)
	{
		f[i] = i;
	}
}

int find(int i)
{
	if (f[i] == i)
		return i;
	return f[i] = find(f[i]);
}

void merge(int i, int j)
{
	int x = find(i), y = find(j);
	if (x == y)
		return;
	f[x] = y;
}

int main()
{
	qwq;
	int n, m;
	cin >> n >> m;
	value();
	for (int i = 1; i <= m; i++)
	{
		cin >> u[i] >> v[i];
	}
	for (int i = 1; i <= n; i++)
	{
		cin >> c[i];
		++ b[c[i]];
	}
	for (int i = n; i >= 1; i--)
	{
		-- b[c[i]];
		for (int j = 1; j <= m; j++)
		{
			if (!(b[u[j]]) && !(b[v[j]]))
				merge(u[j], v[j]);
		}
		ans[n] = 0;
		for (int j = 1; j <= n; j++)
		{
			int t = find(j);
			if (j == t && !(b[j]))
				++ ans[i];
		}
	} 
	for (int i = 1; i <= n - 1; i++)
	{
		if (ans[i] == 1)
			printf("YES\n");
		else
			printf("NO\n");
	}
	return 0;
}