#include<algorithm>

#include<cstring>

#include<cstdio>

#include<iostream>

using namespace std;

const int N=1e5+;

int n,tot;

int h[N],fa[N][],dep[N];

struct E{

    int to,nxt;

}e[N<<];

inline int read(){

    char ch=getchar();int s=,f=;

    while (ch<''||ch>'') {if (ch=='-') f=-;ch=getchar();}

    while (ch>=''&&ch<='') {s=(s<<)+(s<<)+ch-'';ch=getchar();}

    return s*f;

}

void link(int u,int v){e[++tot]=(E){v,h[u]};h[u]=tot;}

void dfs(int x,int pre){

    for (int i=;i<;i++) fa[x][i]=fa[fa[x][i-]][i-];

    for (int i=h[x],y;i;i=e[i].nxt){

        if ((y=e[i].to)==pre) continue;

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

        dfs(y,x);

    }

}

int lca(int x,int y){

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

    for (int i=;i>=;i--) if (dep[fa[x][i]]>=dep[y]) x=fa[x][i];

    if (x==y) return x;

    for (int i=;i>=;i--) if (fa[x][i]!=fa[y][i]) x=fa[x][i],y=fa[y][i];

    return fa[x][];

}

bool chk(int a,int b,int La,int Lb){

    if (dep[Lb]<dep[La]) return ;

    if (dep[a]>=dep[Lb]){

        for (int i=;i>=;i--) if (dep[fa[a][i]]>=dep[Lb]&&dep[fa[a][i]]>=dep[La]) a=fa[a][i];

        if (a==Lb) return ;

    }

    if (dep[b]>=dep[Lb]){

        for (int i=;i>=;i--) if (dep[fa[b][i]]>=dep[Lb]&&dep[fa[b][i]]>=dep[La]) b=fa[b][i];

        if (b==Lb) return ;

    }

    return ;

}

int main(){

    freopen("inter.in","r",stdin);

    freopen("inter.out","w",stdout);

    n=read();

    for (int i=,u,v;i<n;i++){

        u=read();v=read();

        link(u,v);link(v,u);

    }

    dep[]=;dfs(,);

    int q=read();

    while (q--){

        int a=read(),b=read(),c=read(),d=read();

        int lab=lca(a,b),lcd=lca(c,d);

        //printf("%d %d\n",lab,lcd);

        if (chk(a,b,lab,lcd)||chk(c,d,lcd,lab)) puts("YES");

        else puts("NO");

    }

    return ;

}