#include<cstdio>

 #include<algorithm>

 #include<cstring>

 #define LL long long

 #define rg register

 #define N 500010

 using namespace std;

 int n,m,tot,last[N],siz[N],fa[N],dep[N],hvy[N],top[N];

 struct edge{

     int to,pre;

 }e[N<<];

 inline int read(){

     int k=,f=; char c=getchar();

     while(c<''||c>'')c=='-'&&(f=-),c=getchar();

     while(''<=c&&c<='')k=k*+c-'',c=getchar();

     return k*f;

 }

 void dfs1(int x){

     siz[x]=; dep[x]=dep[fa[x]]+;

     for(rg int i=last[x],to;i;i=e[i].pre)if((to=e[i].to)!=fa[x]){

         fa[to]=x; dfs1(to); siz[x]+=siz[to];

         if(siz[to]>siz[hvy[x]]) hvy[x]=to;

     }

 }

 void dfs2(int x,int tp){

     top[x]=tp;

     if(hvy[x]) dfs2(hvy[x],tp);

     for(rg int i=last[x],to;i;i=e[i].pre)if((to=e[i].to)!=fa[x]&&to!=hvy[x])

         dfs2(to,to);

 }

 inline int lca(int x,int y){

     int t1=top[x],t2=top[y];

     while(t1!=t2){

         if(dep[t1]<dep[t2]) swap(t1,t2),swap(x,y);

         x=fa[t1]; t1=top[x];

     }

     return dep[x]<dep[y]?x:y;

 }

 int main(){

     n=read(); m=read();

     for(rg int i=;i<n;i++){

         int u=read(),v=read();

         e[++tot]=(edge){v,last[u]}; last[u]=tot;

         e[++tot]=(edge){u,last[v]}; last[v]=tot;

     }

     dfs1(); dfs2(,);

     while(m--){

         int a=read(),b=read(),x=read(),y=read();

         int L1=lca(a,b),L2=lca(x,y);

         if(dep[L1]>dep[L2]) swap(L1,L2),swap(a,x),swap(b,y);

         puts(lca(L2,a)==L2||lca(L2,b)==L2?"Y":"N");

     }

     return ;

 }