#include <iostream>#include <cstdio>#include <cstring>#include <map>#include <string>using namespace std;const int INF = 0x7fffffff;const int maxv = 60;const int maxe = 15000;int score[55];int champ[55][55];struct Edge{ int v; int next; int flow;};Edge e[maxe];int head[maxv],edgeNum;int now[maxv],d[maxv],vh[maxv],pre[maxv],preh[maxv];void addEdge(int a,int b,int c){ e[edgeNum].v = b; e[edgeNum].flow = c; e[edgeNum].next = head[a]; head[a] = edgeNum++; e[edgeNum].v = a; e[edgeNum].flow = 0; e[edgeNum].next = head[b]; head[b] = edgeNum++;}void Init(){ edgeNum = 0; memset(head,-1,sizeof(head)); memset(d,0,sizeof(d));}int sap(int s,int t,int n) { int i,x,y; int f,ans = 0; for(i = 0; i < n; i++) now[i] = head[i]; vh[0] = n; x = s; while(d[s] < n) { for(i = now[x]; i != -1; i = e[i].next) if(e[i].flow > 0 && d[y=e[i].v] + 1 == d[x]) break; if(i != -1) { now[x] = preh[y] = i; pre[y] = x; if((x=y) == t) { for(f = INF,i=t; i != s; i = pre[i]) if(e[preh[i]].flow < f) f = e[preh[i]].flow; ans += f; do { e[preh[x]].flow -= f; e[preh[x]^1].flow += f; x = pre[x]; }while(x!=s); } } else { if(!--vh[d[x]]) break; d[x] = n; for(i=now[x]=head[x]; i != -1; i = e[i].next) { if(e[i].flow > 0 && d[x] > d[e[i].v] + 1) { now[x] = i; d[x] = d[e[i].v] + 1; } } ++vh[d[x]]; if(x != s) x = pre[x]; } } return ans;}int main(){ int i,j; int n,m; int p; int k; int seq1,seq2; char p1[15],p2[15],result[10]; map<string,int> mp; map<string,int>::iterator it; while(scanf("%d %d",&n,&m)!=EOF) { k = 0; Init(); mp.clear(); memset(score,0,sizeof(score)); memset(champ,0,sizeof(champ)); mp["DD"] = 0; for(i = 0; i < m; i++) { scanf("%s %s %s",p1,p2,result); it = mp.find(p1); if(it == mp.end()) { seq1 = ++k; mp[p1] = seq1; } else seq1 = it->second; it = mp.find(p2); if(it == mp.end()) { seq2 = ++k; mp[p2] = seq2; } else seq2 = it->second; if(result[0] == 'w') score[seq1]++; else score[seq2]++; } scanf("%d",&p); for(i = 0; i < p; i++) { scanf("%s %s",p1,p2); it = mp.find(p1); if(it == mp.end()) { seq1 = ++k; mp[p1] = seq1; } else seq1 = it->second; it = mp.find(p2); if(it == mp.end()) { seq2 = ++k; mp[p2] = seq2; } else seq2 = it->second; if(seq1 > seq2) swap(seq1,seq2); score[seq1]++; champ[seq1][seq2]++; } int source = 0; int sink = k+1; int sum = 0; for(i = 1; i <= k; i++) { sum += score[i]; addEdge(source,i,score[i]); addEdge(i,sink,score[0]-1); for(j = i+1; j <= k; j++) { if(champ[i][j]) addEdge(i,j,champ[i][j]); } } if(sum == sap(source,sink,sink+1)) printf("Yesn"); else printf("Non"); } return 0;}
