#include<cstdio>

 #include<cstdlib>

 #include<cmath>

 #include<cstring>

 #include<algorithm>

 #include<iostream>

 #include<vector>

 #include<map>

 #include<set>

 #include<queue>

 #include<string>

 #define inf 1000000000

 #define maxn 100000+5

 #define maxm 100000+5

 #define eps 1e-10

 #define ll long long

 #define pa pair<int,int>

 #define for0(i,n) for(int i=0;i<=(n);i++)

 #define for1(i,n) for(int i=1;i<=(n);i++)

 #define for2(i,x,y) for(int i=(x);i<=(y);i++)

 #define for3(i,x,y) for(int i=(x);i>=(y);i--)

 #define for4(i,x) for(int i=head[x],y=e[i].go;i;i=e[i].next,y=e[i].go)

 #define mod 1000000007

 using namespace std;

 inline int read()

 {

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

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

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

     return x*f;

 }

 int  n,m,s,t,maxflow,cnt,ti,top,tot=,a[maxn],sta[maxn],low[maxn],dfn[maxn],scc[maxn],head[maxn],cur[maxn],h[maxn];

 queue<int>q;

 struct edge{int go,next,v;}e[maxm];

 void add(int x,int y,int v)

 {

     e[++tot]=(edge){y,head[x],v};head[x]=tot;

     e[++tot]=(edge){x,head[y],};head[y]=tot;

 }

 bool bfs()

 {

     for(int i=s;i<=t;i++)h[i]=-;

     q.push(s);h[s]=;

     while(!q.empty())

     {

         int x=q.front();q.pop();

         for(int i=head[x];i;i=e[i].next)

          if(e[i].v&&h[e[i].go]==-)

          {

             h[e[i].go]=h[x]+;q.push(e[i].go);

          }

     }

     return h[t]!=-;

 }

 int dfs(int x,int f)

 {

     if(x==t) return f;

     int tmp,used=;

     for(int i=cur[x];i;i=e[i].next)

      if(e[i].v&&h[e[i].go]==h[x]+)

     {

         tmp=dfs(e[i].go,min(e[i].v,f-used));

         e[i].v-=tmp;if(e[i].v)cur[x]=i;

         e[i^].v+=tmp;used+=tmp;

         if(used==f)return f;

     }

     if(!used) h[x]=-;

     return used;

 }

 void dinic()

 {

     maxflow=;

     while(bfs())

     {

         for (int i=s;i<=t;i++)cur[i]=head[i];maxflow+=dfs(s,inf);

     }

 }

 void tarjan(int x)

 {

     low[x]=dfn[x]=++ti;sta[++top]=x;

     for4(i,x)if(e[i].v)

     {

      if (!dfn[y])

       {

           tarjan(y);

           low[x]=min(low[x],low[y]);

       }

      else if(!scc[y])low[x]=min(low[x],dfn[y]);

     }

     if(low[x]==dfn[x])

     {

         cnt++;

         for(int y=-;y!=x;scc[y=sta[top--]]=cnt);

     }

 }

 char ch[];

 string st;

 map<string,int>mp;

 int main()

 {

     freopen("input.txt","r",stdin);

     freopen("output.txt","w",stdout);

     n=read();s=;t=*n+;

     for1(i,n)

      for0(j,)

       {

           memset(ch,,sizeof(ch));scanf("%s",ch);st=ch;

           mp[st]=*i-+j;

       }

     for1(i,n)add(s,*i-,),add(*i,t,),add(*i-,*i,),a[i]=tot-;

     m=read();

     while(m--)

     {

        memset(ch,,sizeof(ch));scanf("%s",ch);st=ch;

        int x=mp[st];

        memset(ch,,sizeof(ch));scanf("%s",ch);st=ch;

        int y=mp[st];

        add(x,y,);

     }

     dinic();

     for2(i,s,t)if(!dfn[i])tarjan(i);

     //for2(i,s,t)cout<<i<<' '<<scc[i]<<endl;

     for1(i,n)printf("%s\n",(!e[a[i]].v&&scc[e[a[i]].go]!=scc[e[a[i]^].go])?"Safe":"Unsafe");

     return ;

 }