#include <cstdlib>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <map>
#include <stack>
#include <vector>
#include <map>
#include <queue>
#include <ctime>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef unsigned int uint;
const int inf=1061109567;
const int maxn=1010;
const int maxm=110;
const int mod=338;
const double pi=3.14;

struct node
{
    int to;
    int val;
};

int vis[maxn];int mk;
int depth[maxn];
int f[maxn][maxm];
int d[maxn][maxn];
vector<int> G[maxn];

void Swap(int &a,int &b) {int t=a;a=b;b=t;}

void build_tree(int u,int deep)
{
    vis[u]=1;depth[u]=deep;
    int len=G[u].size();
    for(int i=0;i<len;i++)
    {
        int v=G[u][i];
        if(!vis[v])
        {
            vis[v]=1;f[v][0]=u;
            build_tree(v,deep+1);
        }
    }
}

void BFS(int st)
{
    queue<node> q;d[st][st]=0;
    q.push((node){st,1});vis[st]=1;
    while(!q.empty())
    {
        node u=q.front();
        q.pop();
        int len=G[u.to].size();
        for(int i=0;i<len;i++)
        {
            int v=G[u.to][i];
            d[st][v]=min(d[st][v],u.val);
            if(!vis[v])
            {
                q.push((node){v,u.val+1});vis[v]=1;
            }
        }
    }
}

int lca(int x,int y)
{
    if(depth[x]<depth[y]) Swap(x,y);
    for(int k=mk;k>=0;k--)
        if(depth[x]>depth[y]&&depth[f[x][k]]>=depth[y]) x=f[x][k];
    for(int k=mk;k>=0;k--)
        if(f[x][k]!=f[y][k]) x=f[x][k],y=f[y][k];
    if(x!=y) return f[x][0];
    return x;
}

int main()
{
    freopen("asm_virus.in","r",stdin);
    freopen("asm_virus.out","w",stdout);
    //clock_t st=clock();
    memset(d,0x3f,sizeof(d));
    int n,q,u,v;scanf("%d%d",&n,&q);
    mk=int(log2(n+0.5));
    for(int i=1;i<n;i++)
    {
        scanf("%d%d",&u,&v);
        G[u].push_back(v);
        G[v].push_back(u);
    }
    build_tree(1,1);
    for(int k=1;k<=mk;k++)
    {
        for(int i=1;i<=n;i++)
        {
            f[i][k]=f[f[i][k-1]][k-1];
        }
    }
    for(int i=1;i<=n;i++)
    {
        memset(vis,0,sizeof(vis));
        BFS(i);
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            printf("%d ",d[i][j]);
        }
        printf("\n");
    }
    int s1,t1,s2,t2;
    while(q--)
    {
        scanf("%d%d%d%d",&s1,&t1,&s2,&t2);
        bool flag=false;int t;
        t=lca(s1,s2);
        if(!flag&&d[s1][t]+d[t][t1]==d[s1][t1]
                &&d[s2][t]+d[t][t2]==d[s2][t2]) flag=true;
        t=lca(s1,t2);
        if(!flag&&d[s1][t]+d[t][t1]==d[s1][t1]
                &&d[s2][t]+d[t][t2]==d[s2][t2]) flag=true;
        t=lca(t1,s2);
        if(!flag&&d[s1][t]+d[t][t1]==d[s1][t1]
                &&d[s2][t]+d[t][t2]==d[s2][t2]) flag=true;
        t=lca(t1,t2);
        if(!flag&&d[s1][t]+d[t][t1]==d[s1][t1]
                &&d[s2][t]+d[t][t2]==d[s2][t2]) flag=true;
        if(!flag) printf("NO\n");
        else printf("YES\n");
    }
    //clock_t ed=clock();
    //printf("\nTime used : %.5lf Ms\n",double(ed-st)/CLOCKS_PER_SEC);
    return 0;
}