#include<iostream>
#include<cstdio>
using namespace std;int n, q;struct Node {int v, nex;Node ( int v = 0, int nex = 0 ) :v ( v ), nex ( nex ) { }
} Edge[200005];int h[100005], stot;
void add ( int u, int v ) {Edge[++stot] = Node ( v, h[u] );h[u] = stot;
}int fa[100005], siz[100005], son[100005], dep[100005];
void dfs1 ( int u, int f ) {fa[u] = f;    siz[u] = 1;    dep[u] = dep[f] + 1;for ( int i = h[u]; i; i = Edge[i].nex ) {int v = Edge[i].v;if ( v == f ) continue;dfs1 ( v, u );siz[u] += siz[v];if ( siz[v] > siz[son[u]] ) son[u] = v;}
}int top[100005], in[100005], ti;
void dfs2 ( int u, int t ) {top[u] = t;    in[u] = ++ ti;if ( son[u] ) dfs2 ( son[u], t );for ( int i = h[u]; i; i = Edge[i].nex ) {int v = Edge[i].v;if ( v == fa[u] || v == son[u] ) continue;dfs2 ( v, v );}
}int TR[400004], tag[400005];
void update ( int nd ) { TR[nd] = TR[nd << 1] + TR[nd << 1 | 1]; }void push_down ( int nd, int l, int r ) {if ( tag[nd] ) {int mid = ( l + r ) >> 1;tag[nd << 1] += tag[nd];tag[nd << 1 | 1] += tag[nd];TR[nd << 1] += tag[nd] * ( mid - l + 1 );TR[nd << 1 | 1] += tag[nd] * ( r - mid );tag[nd] = 0;}
}void add ( int nd, int l, int r, int L, int R, int d ) {if ( l >= L && r <= R ) {TR[nd] += d * ( r - l + 1 );tag[nd] += d;return ;}push_down ( nd, l, r );int mid = ( l + r ) >> 1;if ( L <= mid ) add ( nd << 1, l, mid, L, R, d );if ( R > mid ) add ( nd << 1 | 1, mid + 1, r, L, R, d );update ( nd );
}void add ( int u, int v, int d ) {while ( top[u] != top[v] ) {if ( dep[top[u]] < dep[top[v]] ) swap ( u, v );add ( 1, 1, n, in[top[u]], in[u], d );u = fa[top[u]];}if ( dep[u] < dep[v] ) swap ( u, v );add ( 1, 1, n, in[v], in[u], d );
}int query ( int nd, int l, int r, int L, int R ) {if ( l >= L && r <= R ) return TR[nd];push_down ( nd, l, r );int ans = 0; int mid = ( l + r ) >> 1;if ( L <= mid ) ans += query ( nd << 1, l, mid, L, R );if ( R > mid ) ans += query ( nd << 1 | 1, mid + 1, r, L, R );return ans;
}int query ( int u, int v ) {int ans = 0;while ( top[u] != top[v] ) {if ( dep[top[u]] < dep[top[v]] ) swap ( u, v );ans += query ( 1, 1, n, in[top[u]], in[u] );u = fa[top[u]];}if ( dep[u] < dep[v] ) swap ( u, v );ans += query ( 1, 1, n, in[v], in[u] );return ans;
}int main ( ) {scanf ( "%d%d", &n, &q );for ( int i = 1; i < n; i ++ ) {int u, v;scanf ( "%d%d", &u, &v );add ( u, v );add ( v, u );}dfs1 ( 1, 0 );dfs2 ( 1, 0 );for ( int i = 1; i <= q; i ++ ) {int a, b, c, d;scanf ( "%d%d%d%d", &a, &b, &c, &d );add ( a, b, 1 );int tmp = query ( c, d );if ( tmp ) printf ( "Y\n" );else printf ( "N\n" );add ( a, b, -1 );}return 0;
}

#include<iostream>
#include<cstdio>
using namespace std;const int P = 20;int n, q;struct Node {int v, nex;Node ( int v = 0, int nex = 0 ) :v ( v ), nex ( nex ) { }
} Edge[200005];int h[100005], stot;
void add ( int u, int v ) {Edge[++stot] = Node ( v, h[u] );h[u] = stot;
}int jum[100005][P+1], dep[100005];
void dfs ( int u, int f ) {jum[u][0] = f;for ( int i = 1; i <= P; i ++ )jum[u][i] = jum[jum[u][i-1]][i-1];for ( int i = h[u]; i; i = Edge[i].nex ) {int v = Edge[i].v;if ( v == f ) continue;dep[v] = dep[u] + 1;dfs ( v, u );}
}int LCA ( int u, int v ) {if ( dep[u] < dep[v] ) swap ( u, v );int t = dep[u] - dep[v];for ( int p = 0; t; t >>= 1, p ++ )if ( t & 1 ) u = jum[u][p];if ( u == v ) return u;for ( int p = P; p >= 0; p -- )if ( jum[u][p] != jum[v][p] ) u = jum[u][p], v = jum[v][p];return jum[u][0];
}int main ( ) {scanf ( "%d%d", &n, &q );for ( int i = 1; i < n; i ++ ) {int u, v;scanf ( "%d%d", &u, &v );add ( u, v );    add ( v, u );}dfs ( 1, 0 );for ( int i = 1; i <= q; i ++ ) {int a, b, c, d;scanf ( "%d%d%d%d", &a, &b, &c, &d );int S = LCA ( a, b ), T = LCA ( c, d );if ( dep[S] < dep[T] ) {swap ( S, T );swap ( a, c );swap ( b, d );}if ( LCA ( S, c ) == S || LCA ( S, d ) == S ) cout << "Y" << endl;else cout << "N" << endl;}return 0;
}