#include<iostream>
#include<cstdio>
#include<map>
#include<stack>
using namespace std;
const int MAXN = 50000 + 5;
const int MAXM = 50000 + 5;
struct Edge {
    int nxt;
    int to;
} l[MAXN + MAXM];
int n,m,num;
int tot,stamp;
int head[MAXN],cnt;
int boy[MAXN],girl[MAXN];
int low[MAXN],dfn[MAXN],col[MAXN];//col为所在强连通分量的标号
bool in[MAXN],vis[MAXN];
map<string,int> MP;
stack<int> S;
inline void add(string x,string y) {
    int a,b;
    if(MP.count(x)) a = MP[x];
    else MP[x] = ++num, a = num;
    if(MP.count(y)) b = MP[y];
    else MP[y] = ++num, b = num;
    cnt++;
    l[cnt].nxt = head[a];
    l[cnt].to = b;
    head[a] = cnt;
    return;
}
void tarjan(int x) {
    low[x] = dfn[x] = ++stamp;
    vis[x] = in[x] = true;
    S.push(x);
    for(int i = head[x];i;i = l[i].nxt) {
        if(!dfn[l[i].to]) {
            tarjan(l[i].to);
            low[x] = min(low[x],low[l[i].to]);
        } else if(in[l[i].to]) {
            low[x] = min(low[x],dfn[l[i].to]);
        }
    }
    if(dfn[x] == low[x]) {
        tot++;
        while(S.top() != x) {
            col[S.top()] = tot;
            in[S.top()] = false;
            S.pop();
        }
        col[x] = tot;
        in[x] = false;
        S.pop();
    }
    return;
}
int main() {
    scanf("%d",&n);
    string x,y;
    for(int i = 1;i <= n;i++) {
        cin>>x>>y;
        add(x,y);
        boy[i] = MP[x],girl[i] = MP[y];
    }
    scanf("%d",&m);
    for(int i = 1;i <= m;i++) {
        cin>>x>>y;
        add(y,x);
    }
    for(int i = 1;i <= num;i++) {
        if(!vis[i]) tarjan(i);
    }
    for(int i = 1;i <= n;i++) {
        if(col[boy[i]] == col[girl[i]]) puts("Unsafe");
        else puts("Safe");
    }
    return 0;
}