#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<cstring>
#include<string>
#include<cstdlib>
#include<set>
#include<map>
using namespace std;
int n,q;
bool use[1010];
struct str{
	vector<int> son;
}a[1010];
vector<int>f1;
vector<int>f2;
bool fun(int x,int y,int ok){
	if(x==y){
	if(ok==1)f1.push_back(x);
	else f2.push_back(x);
	 return 1;
    }
	use[x]=1;
	for(int i=0;i<a[x].son.size();i++){
		if(use[a[x].son[i]]==0)
		if(fun(a[x].son[i],y,ok)==1){
		if(ok==1)	f1.push_back(x);
		else f2.push_back(x);
			use[x]=1;
			return 1;
		}
	}
	use[x]=0;
	return 0;
}
int main(){
	freopen("asm_virus.in","r",stdin);
	freopen("asm_virus.out","w",stdout);
	cin>>n>>q;
	int k1,k2;
	for(int i=1;i<=n-1;i++){
		cin>>k1>>k2;
		a[k1].son.push_back(k2);
		a[k2].son.push_back(k1);
		//f[k1][k1].son.push_back(k1);
		//f[k2][k2].son.push_back(k2);
	}
	int s1,t1,s2,t2,ok;
	for(int i=1;i<=q;i++){
		ok=0;
		f1.clear();
		f2.clear();
		cin>>s1>>t1>>s2>>t2;
		k1=fun(s1,t1,1);
		k2=fun(s2,t2,2);
		for(int i=0;i<f1.size();i++)
		{
			for(int j=0;j<f2.size();j++)
			{
				if(f1[i]==f2[j])
				{
					ok=1;
					cout<<"YES"<<endl;
				}
			}
		}
		if(ok==0) cout<<"NO"<<endl;
	}
	return 0;
}