#include <iostream>
#include<queue>
#include<vector> 
using namespace std;
int main() {
	int n,e;
	cin>>n>>e;
	vector<vector<int>> adjList(n+1);
	for(int i = 0 ; i < e ; i++){
		int x,y;
		cin>>x>>y;
		adjList[x].push_back(y);
		adjList[y].push_back(x);
	}
 
	int scr;
	cin>>scr;
 
	queue<int> q;
	q.push(scr);
	vector<int> visited(n+1,0);
	visited[scr] = 1;
 
	while(!q.empty()){
		int top = q.front();
		q.pop();
		for(auto &it:adjList[top]){
			if(visited[it] == 0){
				q.push(it);
				visited[it] = 1;
 
			}
		}
	}
 
	for(int i = 1 ; i <= n ; i++){
		if(visited[i] == 0)
			cout<<"NO"<<endl;
		else
			cout<<"YES"<<endl;
	}
	return 0;
 
 
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxxdWV1ZT4KI2luY2x1ZGU8dmVjdG9yPiAKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKaW50IG1haW4oKSB7CglpbnQgbixlOwoJY2luPj5uPj5lOwoJdmVjdG9yPHZlY3RvcjxpbnQ+PiBhZGpMaXN0KG4rMSk7Cglmb3IoaW50IGkgPSAwIDsgaSA8IGUgOyBpKyspewoJCWludCB4LHk7CgkJY2luPj54Pj55OwoJCWFkakxpc3RbeF0ucHVzaF9iYWNrKHkpOwoJCWFkakxpc3RbeV0ucHVzaF9iYWNrKHgpOwoJfQoKCWludCBzY3I7CgljaW4+PnNjcjsKCglxdWV1ZTxpbnQ+IHE7CglxLnB1c2goc2NyKTsKCXZlY3RvcjxpbnQ+IHZpc2l0ZWQobisxLDApOwoJdmlzaXRlZFtzY3JdID0gMTsKCgl3aGlsZSghcS5lbXB0eSgpKXsKCQlpbnQgdG9wID0gcS5mcm9udCgpOwoJCXEucG9wKCk7CgkJZm9yKGF1dG8gJml0OmFkakxpc3RbdG9wXSl7CgkJCWlmKHZpc2l0ZWRbaXRdID09IDApewoJCQkJcS5wdXNoKGl0KTsKCQkJCXZpc2l0ZWRbaXRdID0gMTsKCQkJCgkJCX0KCQl9Cgl9CgoJZm9yKGludCBpID0gMSA7IGkgPD0gbiA7IGkrKyl7CgkJaWYodmlzaXRlZFtpXSA9PSAwKQoJCQljb3V0PDwiTk8iPDxlbmRsOwoJCWVsc2UKCQkJY291dDw8IllFUyI8PGVuZGw7Cgl9CglyZXR1cm4gMDsKCgkKfQ==

NiAzCjEgMgoyIDMKNCA1CjE=

6 3
1 2
2 3
4 5
1