#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <cmath>

#include <atcoder/scc>

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef string str;

#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define MAX_LL (1LL<<62)
//#define MOD 998244353
//#define MOD 1000000007

ll upper_char_to_ll(const char &c) {return ll(c)-65;}
ll lower_char_to_ll(const char &c) {return ll(c)-97;}

ll max(const ll &a, const ll &b) {if(a>b) return a; else return b;}
ll min(const ll &a, const ll &b) {if(a<b) return a; else return b;}
ll calc_gcd(ll a, ll b) {while(true){if(a*b == 0) return a+b; else if(a>b) a %= b; else b %= a;}}
ull pow_mod(ull a, ull b, ull mod=-1) {if(mod<2) return 0; ull ans=1, now=a; while(b>0){if(b%2) ans=(ans*now)%mod; now=(now*now)%mod; b/=2;} return ans;}

bool update_max(ll &a, const ll &b) {if(a<b){a=b; return true;} else return false;}
bool update_max(ld &a, const ld &b) {if(a<b){a=b; return true;} else return false;}
bool update_min(ll &a, const ll &b) {if(a>b){a=b; return true;} else return false;}
bool update_min(ld &a, const ld &b) {if(a>b){a=b; return true;} else return false;}

int main() {
  ll N;
  cin >> N;
  
  vector<vector<ll>> A(N);
  for(ll i=0; i<N; i++){
  	ll M;
  	cin >> M;
  	for(ll j=0; j<M; j++){
  		ll temp;
  		cin >> temp;
  		A[i].push_back(temp);
  	}
  }
  
  atcoder::scc_graph graph(N);
  for(ll i=0; i<N; i++){
  	for(ll j=0; j<A[i].size(); j++){
  		graph.add_edge(i, A[i][j]-1);
  	}
  }
  
  vector<vector<int>> scc = graph.scc();
  vector<ll> topological(N);
  
  for(ll i=0; i<scc.size(); i++){
  	for(ll j=0; j<scc[i].size(); j++){
  		topological[scc[i][j]] = i;
  	}
  }
  
  if(topological[0] != 0){
  	cout << "No" << endl;
  	return 0;
  }
  
  for(ll i=0; i<scc.size(); i++){
  	for(ll j=0; j<scc[i].size(); j++){
  		for(ll k=0; k<A[scc[i][j]].size(); k++){
  			if(topological[A[scc[i][j]][k]-1] == i+1)
  				goto next;
  		}
  		if(j == scc[i].size()-1){
  			cout << "No" << endl;
  			return 0;
  		}
  	}
  	next:;
  }
  
  cout << "Yes" << endl;
  return 0;
}