#pragma GCC optimize(2,3)
#include<bits/stdc++.h>
using namespace std;

#define ull unsigned long long

const int maxn=1e5+5;

inline ull read()
{
    ull sum=0;char c=getchar();
    while(c<'0'||c>'9') c=getchar();
    while('0'<=c&&c<='9') sum=(sum<<1)+(sum<<3)+(c-'0'),c=getchar();
    return sum;
}

class LintCutTree
{
    public:
        struct valnode{ull v0,v1;};
        struct treenode{int ch[2],fa,opt;bool tag;valnode f,g;ull x;}tr[maxn];
        inline ull calc(ull v,int x)
        {
            if(tr[x].opt==1) return v&tr[x].x;
            else if(tr[x].opt==2) return v|tr[x].x;
            return v^tr[x].x;
        }
        inline valnode merge(valnode x,valnode y)
        {
            valnode ans={0,0};
            ans.v0=(x.v0&y.v1)|((~x.v0)&y.v0);
            ans.v1=(x.v1&y.v1)|((~x.v1)&y.v0);
            return ans;
        }
    private:
        #define lch(x) tr[x].ch[0]
        #define rch(x) tr[x].ch[1]
        #define Get(x) (rch(tr[x].fa)==x)
        #define Isroot(x) (lch(tr[x].fa)!=x&&rch(tr[x].fa)!=x)
        inline void pushup(int x)
        {
            tr[x].f.v0=calc(0ull,x);tr[x].f.v1=calc((1ull<<64)-1,x);
            tr[x].g.v0=calc(0ull,x);tr[x].g.v1=calc((1ull<<64)-1,x);
            if(rch(x)) tr[x].f=merge(tr[rch(x)].f,tr[x].f),tr[x].g=merge(tr[x].g,tr[rch(x)].g);
            if(lch(x)) tr[x].f=merge(tr[x].f,tr[lch(x)].f),tr[x].g=merge(tr[lch(x)].g,tr[x].g);
        }
        inline void rev(int x){swap(lch(x),rch(x));swap(tr[x].f,tr[x].g);tr[x].tag^=1;}
        inline void pushdown(int x)
        {
            if(tr[x].tag)
            {
                if(lch(x)) rev(lch(x));
                if(rch(x)) rev(rch(x));
                tr[x].tag=0;
            }
        }
        inline void updata(int x){if(!Isroot(x)) updata(tr[x].fa);pushdown(x);}
        inline void rotate(int x)
        {
            int y=tr[x].fa,z=tr[y].fa,k=Get(x);
            if(!Isroot(y)) tr[z].ch[rch(z)==y]=x;
            tr[y].ch[k]=tr[x].ch[!k];if(tr[x].ch[!k]) tr[tr[x].ch[!k]].fa=y;
            tr[x].ch[!k]=y;tr[y].fa=x,tr[x].fa=z;
            pushup(y),pushup(x);
        }
        inline void splay(int x){updata(x);for(int fa;fa=tr[x].fa,!Isroot(x);rotate(x)) if(!Isroot(fa)) rotate(Get(fa)==Get(x)?fa:x);}
        inline int Access(int x){int p=0;for(;x;p=x,x=tr[x].fa) splay(x),tr[x].ch[1]=p,pushup(x);return p;}
    public:
        inline void makeroot(int x){x=Access(x);rev(x);}
        inline void link(int x,int y){makeroot(x);splay(x);tr[x].fa=y;}
        inline void cut(int x,int y){makeroot(x);Access(y);splay(y);tr[y].fa=tr[x].ch[0]=0;pushup(x);}
    public:
        inline void modify(int x,int y,ull z)
        {
            makeroot(x);Access(x);
            tr[x].opt=y,tr[x].x=z;
            tr[x].f.v0=calc(0ull,x);tr[x].f.v1=calc((1ull<<64)-1,x);
            tr[x].g.v0=calc(0ull,x);tr[x].g.v1=calc((1ull<<64)-1,x);
        }
        inline ull qry(int x,int y,ull z)
        {
            makeroot(y);Access(x);splay(y);
            bool flg=0;ull ans=0;
            for(int i=63;~i;i--)
            {
                ull c0=(tr[y].f.v0>>i)&1ull,c1=(tr[y].f.v1>>i)&1ull;
                if(!flg)
                {
                    if((c0^c1)==0)
                    {
                        ans^=c0<<i;
                        if((z>>i)&1) flg=1;
                    }
                    else
                    {
                        if(c0)
                        {
                            ans^=1ull<<i;
                            if((z>>i)&1) flg=1;
                        }
                        else if((z>>i)&1) ans^=1ull<<i;
                    }
                }
                else if(c0||c1) ans^=1ull<<i;
            }
            return ans;
        }
}LCT;

int n,m,k;

int main()
{
    // scanf("%d%d%d",&n,&m,&k);
    n=read(),m=read(),k=read();
    for(int i=1;i<=n;i++)
    {
        // scanf("%d%llu",&LCT.tr[i].opt,&LCT.tr[i].x);
        LCT.tr[i].opt=read(),LCT.tr[i].x=read();
        LCT.tr[i].f.v0=LCT.calc(0ull,i);LCT.tr[i].f.v1=LCT.calc((1ull<<64)-1,i);
        LCT.tr[i].g.v0=LCT.calc(0ull,i);LCT.tr[i].g.v1=LCT.calc((1ull<<64)-1,i);
    }
    for(int i=1;i<n;i++)
    {
        int x,y;
        // scanf("%d%d",&x,&y);
        x=read(),y=read();
        LCT.link(x,y);
    }
    for(int i=1;i<=m;i++)
    {
        int opt,x,y;ull z;
        // scanf("%d%d%d%llu",&opt,&x,&y,&z);
        opt=read(),x=read(),y=read(),z=read();
        if(opt==1) printf("%llu\n",LCT.qry(x,y,z));
        else LCT.modify(x,y,z);
    }
}