#include<iostream>

#include<cstring>

using namespace std;

int a[];

int n,m,l,ci,di;

int root(int x)        //找到根节点

{

    int r = x;

    while(r != a[r])

        r = a[r];

    int i = x,j;

    while(i != r)    //压缩路径

    {

        j = a[i];

        a[i] = r;

        i = j;

    }

    return r;

 } 

void mix(int x,int y)    　　//混合

{

    int fx = root(x),fy = root(y);

    if(fx != fy)

        a[fy] = fx;        //根节点的值覆盖

}

int main()

{

    int i,j,t1,t2;

//    memset(a,0,sizeof(a));        //过程中超时了，除去这一条就AC了

    cin>>n>>m;

    for(i = ;i <= n;i++)

        a[i] = i;

    for(i = ;i <= m;i++)

    {

        cin>>ci>>di;

        mix(ci,di);

    }

    cin>>l;

    for(i = ;i <= l;i++)

    {

        cin>>t1>>t2;

        if(root(t1) != root(t2))

            cout<<"They aren't relative!"<<endl;

        else

            cout<<"They are relative!"<<endl;

    }

    return ;

 }