#include <iostream>
#include <vector>
#include <algorithm>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int n; cin >> n;
    scc_graph graph(n);
    vvi adj(n);
    rep(i, n){
        int m; cin >> m;
        rep(j, m){
            int b; cin >> b;
            graph.add_edge(i, b-1);
            adj[i].push_back(b-1);
        }
    }
    vvi g = graph.scc();
    vector<bool> vb(n, false); vb[0] = true;
    for(auto v : g){
        bool f = false;
        for(auto i : v){
            f = f || vb[i];
        }
        if(!f){
            cout << "No" << endl;
            return 0;
        }
        for(auto i : v){
            vb[i] = true;
            for(auto j : adj[i])vb[j] = true;
        }
    }
    cout << "Yes" << endl;

    return 0;
}