#include <bits/stdc++.h>
                                        #include<iostream>
                                        #include<cstdio>
                                        #include<vector>
                                        #include<queue>
                                        #include<map>
                                        #include<cstring>
                                        #include<string>
                                        #include <math.h>
                                        #include<algorithm>
                                    //    #include <boost/multiprecision/cpp_int.hpp>
                                        #include<functional>
                               #define int long long
                                        #define inf  1000000007
                                        #define pa pair<int,int>
                                        #define ll long long
                                        #define pal pair<double,pa>
                                        #define ppap pair<pa,int>
                                  
                                        #define ssa pair<string,int>
                                        #define  mp make_pair
                                        #define  pb push_back
                                        #define EPS (1e-10)
                                        #define equals(a,b) (fabs((a)-(b))<EPS)
int dx[4]={0,-1,0,1};
int dy[4]={1,0,-1,0};
                                        using namespace std;
                               			class pa3{
                                        	public:
                                        	int x,y,z;
                                        	pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
                                        	bool operator < (const pa3 &p) const{
                                        		if(x!=p.x) return x<p.x;
                                        		if(y!=p.y) return y<p.y;
                                        		 return z<p.z;
                                        		//return x != p.x ? x<p.x: y<p.y;
                                        	}
                               				bool operator > (const pa3 &p) const{
                                        		if(x!=p.x) return x>p.x;
                                        		if(y!=p.y) return y>p.y;
                                        		 return z>p.z;
                                        		//return x != p.x ? x<p.x: y<p.y;
                                        	}
                                        	bool operator == (const pa3 &p) const{
                                        		return x==p.x && y==p.y && z==p.z;
                                        	}
                                        		bool operator != (const pa3 &p) const{
                                        			return !( x==p.x && y==p.y && z==p.z);
                                        	}
                                        
                                        };
                                        
                                        class pa4{
                                        	public:
                                        	double x;
                                        	int y,z,w;
                                        	pa4(double x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
                                        	bool operator < (const pa4 &p) const{
                                        		if(x!=p.x) return x<p.x;
                                        		if(y!=p.y) return y<p.y;
                                        		if(z!=p.z)return z<p.z;
                                        		return w<p.w;
                                        		//return x != p.x ? x<p.x: y<p.y;
                                        	}
                                        	bool operator > (const pa4 &p) const{
                                        		if(x!=p.x) return x>p.x;
                                        		if(y!=p.y) return y>p.y;
                                        		if(z!=p.z)return z>p.z;
                                        		return w>p.w;
                                        		//return x != p.x ? x<p.x: y<p.y;
                                        	}
                                        	bool operator == (const pa4 &p) const{
                                        		return x==p.x && y==p.y && z==p.z &&w==p.w;
                                        	}
                                        		
                                        
                                        };
                                        class pa2{
                                        	public:
                                        	int x,y;
                                        	pa2(int x=0,int y=0):x(x),y(y) {}
                                        	pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
                                        	pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
                                        	bool operator < (const pa2 &p) const{
                                        		return x != p.x ? x<p.x: y<p.y;
                                        	}
                                        	bool operator == (const pa2 &p) const{
                                        		return abs(x-p.x)==0 && abs(y-p.y)==0;
                                        	}
                                        	bool operator != (const pa2 &p) const{
                                        		return !(abs(x-p.x)==0 && abs(y-p.y)==0);
                                        	}
                                        		
                                        
                                        };
                                        
                                               #define ppa pair<int,pas>
                                        class Point{
                                        	public:
                                        	double x,y;
                                        	Point(double x=0,double y=0):x(x),y(y) {}
                                        	Point operator + (Point p) {return Point(x+p.x,y+p.y);}
                                        	Point operator - (Point p) {return Point(x-p.x,y-p.y);}
                                        	Point operator * (double a) {return Point(x*a,y*a);}
                                        	Point operator / (double a) {return Point(x/a,y/a);}
                                        	double absv() {return sqrt(norm());}
                                        	double norm() {return x*x+y*y;}
                                        	bool operator < (const Point &p) const{
                                        		return x != p.x ? x<p.x: y<p.y;
                                        	}
                                        	bool operator == (const Point &p) const{
                                        		return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
                                        	}
                                        };
                                        typedef Point Vector;
                                 #define pl pair<int,pas>
                                        struct Segment{
                                        Point p1,p2;
                                        };
                                         double dot(Vector a,Vector b){
                                        	return a.x*b.x+a.y*b.y;
                                        }
                                        double cross(Vector a,Vector b){
                                        	return a.x*b.y-a.y*b.x;
                                        }
                                    
            bool parareru(Point a,Point b,Point c,Point d){
            //	if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
            	return abs(cross(a-b,d-c))<EPS;
            }
            double distance_ls_p(Point a, Point b, Point c) {
              if ( dot(b-a, c-a) < EPS ) return (c-a).absv();
              if ( dot(a-b, c-b) < EPS ) return (c-b).absv();
              return abs(cross(b-a, c-a)) / (b-a).absv();
            }
            bool is_intersected_ls(Segment a,Segment b) {
            	if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;
            	if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&&parareru((a.p2),(a.p1),(a.p1),(b.p1))){
            //		cout<<"sss"<<endl;
            		if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;
            		if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;
            		if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;
            		if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;
            		return false;
            	}
              else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );
            }
             
            double segment_dis(Segment a,Segment b){
            	if(is_intersected_ls(a,b))return 0;
            	double r=distance_ls_p(a.p1, a.p2, b.p1);
            	r=min(r,distance_ls_p(a.p1, a.p2, b.p2));
            	r=min(r,distance_ls_p(b.p1, b.p2, a.p2));
            	r=min(r,distance_ls_p(b.p1, b.p2, a.p1));
            	return r;
            }
            Point intersection_ls(Segment a, Segment b) {
              Point ba = b.p2-b.p1;
              double d1 = abs(cross(ba, a.p1-b.p1));
              double d2 = abs(cross(ba, a.p2-b.p1));
              double t = d1 / (d1 + d2);
             
              return a.p1 + (a.p2-a.p1) * t;
            }
             
                            string itos( int i ) {
                            ostringstream s ;
                            s << i ;
                            return s.str() ;
                            }
                             
                            int gcd(int v,int b){
                            	if(v>b) return gcd(b,v);
                            	if(v==b) return b;
                            	if(b%v==0) return v;
                            	return gcd(v,b%v);
                            }
             
                            double distans(double x1,double y1,double x2,double y2){
                            	double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
                            	return sqrt(rr);
                            	
                            }
                            
   //         int pr[2000010];
     //       int inv[2000010];
            
            int beki(int wa,int rr,int warukazu){
            	if(rr==0) return 1ll;
            	if(rr==1) return wa%warukazu;
            	if(rr%2==1) return (beki(wa,rr-1,warukazu)*wa)%warukazu;
            	int zx=beki(wa,rr/2,warukazu);
            	return (zx*zx)%warukazu;
            }
            /*
			int comb(int nn,int rr){
				int r=pr[nn]*inv[rr];
				r%=inf;
				r*=inv[nn-rr];
				r%=inf;
				return r;
			}
            
            void gya(int ert){
            	pr[0]=1;
            	for(int i=1;i<ert;i++){
            		pr[i]=(pr[i-1]*i)%inf;
            	}
            	for(int i=0;i<ert;i++) inv[i]=beki(pr[i],inf-2,inf);
            	
            }
             */
			//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;            
             //sort(ve.begin(),ve.end(),greater<int>());
                                     //----------------kokomade tenpure------------
            //vector<double> ans(100000000),ans2(100000000);
 

int n;
int sumi[1+216*216]={0};
vector<int> G1[100020];
vector<int> G2[100020];

int ki[100020];
void dfs(int r,int mae){
	for(auto v:G1[r])if(v!=mae){
		G2[r].pb(v);
		dfs(v,r);
	}
}
int junban[10];
int gyakujun[10];
int jou[100020];

int bit[8]={3,5,1,2,4,6,0,7};
int invbit[8]={6,2,3,0,4,1,5,7};
void saisho(int r,int mae){
	if(r==0){
		jou[r]=6;
		
		
	}
	else{
		if(ki[r]==0){
			jou[r]=invbit[bit[mae]|3];
		}
		if(ki[r]==1){
			jou[r]=invbit[bit[mae]|5];
		}
		if(ki[r]==2){
			jou[r]=invbit[bit[mae]^3];
		}
		if(ki[r]==3){
			jou[r]=invbit[bit[mae]^5];
		}
		if(ki[r]==4){
			jou[r]=invbit[bit[mae]&3];
		}
		if(ki[r]==5){
			jou[r]=invbit[bit[mae]&5];
		}

	}
	for(auto v:G2[r]) saisho(v,jou[r]);
}


int saiki(int r,int dep){
	//cout<<r<<" "<<dep<<endl;
	if(G2[r].size()==0){
		return jou[r];
	}
	
	if(dep%2){
		int d=10;
		for(auto v:G2[r]){
			d=min(d,gyakujun[saiki(v,dep+1)]);
			
		}
		return junban[d];
	}
	
	else{
		int d=-10;
		for(auto v:G2[r]){
			d=max(d,gyakujun[saiki(v,dep+1)]);
			
		}
		return junban[d];
	}
}

int motomeru(vector<pa> ve){
	
	junban[0]=6;
	junban[7]=7;
	for(int i=0;i<6;i++)junban[i+1]=ve[i].second;
	for(int i=0;i<8;i++)gyakujun[junban[i]]=i;
	
	int w=saiki(0,0);
	return w;
}



   signed main(){
   	   	int m;
   	cin>>n>>m;
   
   	for(int i=0;i<216*216+1;i++)sumi[i]=-1;
   	
   	
   	for(int i=1;i<n;i++){
   		string s;
   		cin>>s;
   		
   		if(s=="T=T|X") ki[i]=0;
   		if(s=="T=T|Y") ki[i]=1;
   		if(s=="T=T^X") ki[i]=2;
   		if(s=="T=T^Y") ki[i]=3;
   		if(s=="T=T&X") ki[i]=4;
   		if(s=="T=T&Y") ki[i]=5;
   		
   	}
   	
   		for(int i=0;i<n-1;i++){
   		int y,yy;
   		cin>>y>>yy;
   		G1[y].pb(yy);
   		G1[yy].pb(y);
   	
   	}
  
   	dfs(0,-1);
  // 	cout<<"dd"<<endl;
   	saisho(0,0);
   	for(int df=0;df<m;df++){
   		int x, y;
   	//	cout<<df<<endl;
   		cin>>x>>y;
   		vector<pa> ve;
   		ve.pb(mp(x,0));
   		ve.pb(mp(y,1));
   		ve.pb(mp(x&y,2));
   		ve.pb(mp(x^(x&y),3));
   		ve.pb(mp(y^(x&y),4));
   		ve.pb(mp(x^y,5));
   		sort(ve.begin(),ve.end());
   		int r=0;
   		for(int i=0;i<6;i++){
   			r*=6;
   			r+=ve[i].second;
   		}
   		
   		if(sumi[r]<0){
   			sumi[r]=motomeru(ve);
   			
   		}
   		
   		if(sumi[r]==0) cout<<x<<endl;
   		if(sumi[r]==1) cout<<y<<endl;
   		if(sumi[r]==2) cout<<(x&y)<<endl;
   		if(sumi[r]==3) cout<<(x^(x&y))<<endl;
   		if(sumi[r]==4) cout<<(y^(x&y))<<endl;
   		if(sumi[r]==5) cout<<(x^y)<<endl;
   		if(sumi[r]==6) cout<<0<<endl;
   		if(sumi[r]==7) cout<<(x|y)<<endl;
   			
   			
   		
   	}
   	
   	
   	return 0;
        }


Measured memory_bytes: 22280