#include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME
#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define prArr(a) {cerr<<(#a)<<"={";int i=0;for(auto t:(a))cerr<<(i++?", ":"")<<t;cerr<<"}"<<endl;}
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){
  return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}


signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  string s;
  cin>>s;
  int n = s.size();
  
  int numNode = 0;
  for(int i=0;i<n;i++) if(isalpha(s[i])) numNode++;

  
  vector<int> win(26, 0);
  int sumWin = 0;
  for(int i=0;i<numNode;i++){
    string s;
    int num;
    cin>>s>>num;
    sumWin += num;
    win[s[0] - 'a'] = num;
  }

  int valid = 1;
  int idx = 0;
  assert(s[0]=='[');
  
  function<P()> dfs = [&](){
    if(isalpha(s[idx])) {
      int i = idx++;
      return P(win[s[i] - 'a'], 0);
    }
    
    if(s[idx] == '['){
      idx++;
      auto l = dfs();
      assert(s[idx] == '-');
      idx++;

      auto r = dfs();
      assert(s[idx] == ']');
      idx++;
      if(l.first == l.second) return P(r.first, r.second + 1);
      if(r.first == r.second) return P(l.first, l.second + 1);
      valid = 0;
      return P(0, 0);
    }
    assert(0);
    return P(0, 0);
  };
  
  auto winner = dfs();
  valid &= (winner.first == winner.second);
  assert(idx == n);
  cout<<(valid? "Yes":"No")<<endl;
  
  return 0;
}

