#include <bits/stdc++.h>
using namespace std;
//*/
#include <atcoder/all>
using namespace atcoder;
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#pragma GCC target("avx,avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//*/
#define rep(i,n) for(ll i=0;i<n;i++)
#define Rep(i,a,b) for(int i=a;i<b;i++)
#define ALL(x) (x).begin(),(x).end()
#define dbgv(x); for(auto now : x) cout << now << " "; cout << endl;
//using P = pair<int,int>;
using ll = long long;
using ull = unsigned long long;
//*/
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<int> vint;
random_device rnd;
mt19937 rng(rnd());



void solve(){
  int n; cin >> n;
  vector<vint> mps(n);
  dsu d(n);
  scc_graph g(n);
  vector<vint> to(n);
  rep(i,n){
    int m; cin >> m;
    rep(_,m){
      int x; cin >>x;
      g.add_edge(i,x-1);
      d.merge(i,x-1);
      to[i].push_back(x-1);
    }
  }
  if(d.size(0) != n){
    cout << "No\n";
    return;
  }
  map<int,int> mp;
  auto v = g.scc();
  rep(i,v.size()){
    for(int nxt : v[i]) mp[nxt] = i;
  }
  bool ok = false;
  int start = mp[0];
  queue<int> q;
  vector<bool> jud(v.size(),false);
  vector<bool> vis(n,false);
  jud[start] = true;
  for(int nxt : v[start]){
    q.push(nxt);
    vis[nxt] = true;
  }
  while(!q.empty()){
    int fro = q.front(); q.pop();
    for(int nxt : to[fro])if(!vis[nxt]){
      vis[nxt] = true;
      jud[mp[nxt]] = true;
      q.push(nxt);
    }
  }
  int cnt = 0;
  rep(i,v.size())if(jud[i]) cnt++;
  if(cnt == v.size()) cout << "Yes\n";
  else cout << "No\n";
}
 

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int t = 1; //cin >> t;
  rep(testcase,t) solve();
}