Problem: Today you are to solve the problem even the famous Hercule Poirot can't cope with! That's why this crime has not yet been solved and this story was never included in Agatha Christie's detective story books. 

You are not informed on what crime was committed, when and where the corpse was found and other details. We only know that the crime was committed in a house that has n rooms and m doors between the pairs of rooms. The house residents are very suspicious, that's why all the doors can be locked with keys and all the keys are different. According to the provided evidence on Thursday night all the doors in the house were locked, and it is known in what rooms were the residents, and what kind of keys had any one of them. The same is known for the Friday night, when all the doors were also locked. On Friday it was raining heavily, that's why nobody left the house and nobody entered it. During the day the house residents could

  * open and close doors to the neighboring rooms using the keys at their disposal (every door can be opened and closed from each side); 
  * move freely from a room to a room if a corresponding door is open; 
  * give keys to one another, being in one room. 



"Little grey matter" of Hercule Poirot are not capable of coping with such amount of information. Find out if the positions of people and keys on the Thursday night could result in the positions on Friday night, otherwise somebody among the witnesses is surely lying.

Input

The first line contains three preset integers n, m и k (1 ≤ n, m, k ≤ 1000) — the number of rooms, the number of doors and the number of house residents respectively. The next m lines contain pairs of room numbers which join the doors. The rooms are numbered with integers from 1 to n. There cannot be more that one door between the pair of rooms. No door connects a room with itself. The next k lines describe the residents' position on the first night. Every line contains a resident's name (a non-empty line consisting of no more than 10 Latin letters), then after a space follows the room number, then, after a space — the number of keys the resident has. Then follow written space-separated numbers of the doors that can be unlocked by these keys. The doors are numbered with integers from 1 to m in the order in which they are described in the input data. All the residents have different names, uppercase and lowercase letters considered to be different. Every m keys occurs exactly once in the description. Multiple people may be present in one room, some rooms may be empty. The next k lines describe the position of the residents on the second night in the very same format. It is guaranteed that in the second night's description the residents' names remain the same and every m keys occurs exactly once.

Output

Print "YES" (without quotes) if the second arrangement can result from the first one, otherwise, print "NO".

Examples

Input

2 1 2
1 2
Dmitry 1 1 1
Natalia 2 0
Natalia 1 1 1
Dmitry 2 0


Output

YES


Input

4 4 3
1 3
1 2
2 3
3 4
Artem 1 1 4
Dmitry 1 1 2
Edvard 4 2 1 3
Artem 2 0
Dmitry 1 0
Edvard 4 4 1 2 3 4


Output

NO

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1024;
vector<pair<int, int> > e[MAXN];
struct DisjointSet {
  int p[MAXN];
  bitset<MAXN + MAXN> b[MAXN];
  void init(int n) {
    for (int i = 0; i < n; ++i) {
      p[i] = i;
      b[i].reset();
    }
  }
  int root(int i) { return p[i] == i ? i : (p[i] = root(p[i])); }
  bool setp(int i, int j) {
    i = root(i);
    j = root(j);
    if (i != j) {
      p[i] = j;
      b[j] |= b[i];
      return true;
    } else {
      return false;
    }
  }
  void dfs(const int n, const int s) {
    if (root(s) != s) {
      return;
    }
    bool flag = false;
    vector<bool> mark(n, false);
    queue<int> q;
    int t;
    q.push(s);
    mark[s] = true;
    while (!q.empty()) {
      t = q.front();
      q.pop();
      if (setp(t, s)) {
        flag = true;
      }
      for (vector<pair<int, int> >::const_iterator it = e[t].begin();
           it != e[t].end(); ++it) {
        if (!mark[it->first] && b[s].test(it->second)) {
          mark[it->first] = true;
          q.push(it->first);
        }
      }
    }
    if (flag) {
      dfs(n, s);
    }
  }
} ds1, ds2;
map<string, int> mp;
int getId(const string& s) {
  if (mp.count(s) > 0) {
    return mp[s];
  } else {
    int ret = mp.size();
    mp[s] = ret;
    return ret;
  }
}
void gao(int n, int m, int k, DisjointSet& ds) {
  int r, c, t;
  static char buf[80];
  ds.init(n);
  for (int i = 0; i < k; ++i) {
    scanf("%s%d%d", buf, &r, &c);
    --r;
    ds.b[r].set(m + getId(buf));
    for (int j = 0; j < c; ++j) {
      scanf("%d", &t);
      --t;
      ds.b[r].set(t);
    }
  }
  for (int i = 0; i < n; ++i) {
    ds.dfs(n, i);
  }
}
int main() {
  int n, m, k, a, b;
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 0; i < m; ++i) {
    scanf("%d%d", &a, &b);
    --a;
    --b;
    e[a].push_back(make_pair(b, i));
    e[b].push_back(make_pair(a, i));
  }
  gao(n, m, k, ds1);
  gao(n, m, k, ds2);
  bool flag = true;
  for (int i = 0; i < n; ++i) {
    flag &= (ds1.b[ds1.root(i)] == ds2.b[ds2.root(i)]);
  }
  puts(flag ? "YES" : "NO");
  return 0;
}