#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

vector<int> TopologicalSort(vector<set<int>> g) {
    int n = g.size();
    vector<int> res;
    vector<int> indeg(n);
    for (int v = 0; v < n; v++) {
        for (int nv : g[v]) {
            indeg[nv]++;
        }
    }
    queue<int> q;
    for (int i = 0; i < n; i++) {
        if (indeg[i] == 0) {
            q.push(i);
        }
    }
    while (!q.empty()) {
        int v = q.front();
        q.pop();
        res.push_back(v);
        for (int nv : g[v]) {
            indeg[nv]--;
            if (indeg[nv] == 0) {
                q.push(nv);
            }
        }
    }
    return res;
}

int main() {
    int n;
    cin >> n;
    vector<vector<int>> g(n);
    scc_graph sg(n);
    for (int i = 0; i < n; i++) {
        int m;
        cin >> m;
        while (m--) {
            int j;
            cin >> j;
            j--;
            g[i].push_back(j);
            sg.add_edge(i, j);
        }
    }
    vector<vector<int>> list = sg.scc();
    int sz = list.size();
    vector<int> belong(n);
    for (int i = 0; i < sz; i++) {
        for (int v : list[i]) {
            belong[v] = i;
        }
    }
    vector<set<int>> g2(sz);
    for (int i = 0; i < n; i++) {
        for (int j : g[i]) {
            int u = belong[i], v = belong[j];
            if (u != v ) {
                g2[u].insert(v);
            }
        }
    }
    vector<int> tps = TopologicalSort(g2);
    vector<int> dp(sz);
    int start = belong[0];
    if (tps[0] != start) {
        cout << "No" << endl;
        return 0;
    }
    for (int v : tps) {
        for (int nv : g2[v]) {
            dp[nv] = max(dp[nv], dp[v] + 1);
        }
    }
    int mx = *max_element(dp.begin(), dp.end());
    cout << (mx == sz - 1 ? "Yes" : "No") << endl;
}