#include <bits/stdc++.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))

using namespace std;

template<class T>bool chmax(T &a, const T &b) { return (a < b) ? (a = b, 1) : 0;}
template<class T>bool chmin(T &a, const T &b) { return (b < a) ? (a = b, 1) : 0;}

using ll = long long;
using R = long double;
const R EPS = 1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r) {return (r > EPS) - (r < -EPS);}
inline R sq(R x) {return sqrt(max(x, 0.0L));}

const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};

// Problem Specific Parameter:

map<string, int> dict;
int total = 0;

int convert(string s) {
	if (dict.find(s) == end(dict)) {
		dict[s] = total++;
	}
	return dict[s];
}

using pii = pair<int, int>;
vector<pii> doc[1010];
bool used[1010];

bool rel[310][310];
vector<int> tri[310][310];

int main(void) {
	string p, q;
	cin >> p >> q;

	const int pidx = convert(p), qidx = convert(q);
	rel[pidx][qidx] = true;

	int n;
	cin >> n;

	rep(i, n) {
		int m;
		cin >> m;
		rep(j, m) {
			string a, b;
			cin >> a >> b;
			const int aidx = convert(a), bidx = convert(b);
			doc[i].push_back(pii(aidx, bidx));
			tri[aidx][bidx].push_back(i);
		}
	}

	queue<pii> que;
	que.push(pii(pidx, qidx));

	while (!que.empty()) {
		pii cur = que.front(); que.pop();

		for (auto &idx : tri[cur.first][cur.second]) {
			if (used[idx]) continue;
			used[idx] = true;
			for (auto &elem : doc[idx]) {
				if (rel[elem.first][elem.second]  == false) {
					rel[elem.first][elem.second] = true;
					que.push(pii(elem.first, elem.second));
				}
			}
		}

		rep(i, total) {
			if (rel[cur.second][i] == true and rel[cur.first][i] == false) {
				rel[cur.first][i] = true;
				que.push(pii(cur.first, i));
			}
		}
	}

	bool ok = true;
	rep(i, total)rep(j, total) if (rel[i][j] == true and rel[j][i] == true) ok = false;
	puts(ok ? "Yes" : "No");

	return 0;
}