import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

class LazySegTree:
    def __init__(self, op, e, mapping, composition, _id, v):
        self._op = op
        self._e = e
        self._mapping = mapping
        self._composition = composition
        self._id = _id

        if isinstance(v, int):
            v = [e]*v

        self._n = len(v)
        self._log = (self._n-1).bit_length()
        self._size = 1 << self._log
        self._d = [self._e]*(2*self._size)
        self._lz = [self._id]*self._size
        for i in range(self._n):
            self._d[self._size+i] = v[i]
        for i in range(self._size-1, 0, -1):
            self._update(i)

    def set(self, p, x):
        p += self._size
        for i in range(self._log, 0, -1):
            self._push(p >> i)
        self._d[p] = x
        for i in range(1, self._log+1):
            self._update(p >> i)

    def get(self, p):
        p += self._size
        for i in range(self._log, 0, -1):
            self._push(p >> i)
        return self._d[p]

    def prod(self, left, right):
        if left == right:
            return self._e

        left += self._size
        right += self._size

        for i in range(self._log, 0, -1):
            if ((left >> i) << i) != left:
                self._push(left >> i)
            if ((right >> i) << i) != right:
                self._push(right >> i)

        sml = self._e
        smr = self._e
        while left < right:
            if left & 1:
                sml = self._op(sml, self._d[left])
                left += 1
            if right & 1:
                right -= 1
                smr = self._op(self._d[right], smr)
            left >>= 1
            right >>= 1

        return self._op(sml, smr)

    def all_prod(self):
        return self._d[1]

    def apply(self, left, right, f):
        if right is None:
            p = left
            p += self._size
            for i in range(self._log, 0, -1):
                self._push(p >> i)
            self._d[p] = self._mapping(f, self._d[p])
            for i in range(1, self._log+1):
                self._update(p >> i)
        else:
            if left == right:
                return

            left += self._size
            right += self._size

            for i in range(self._log, 0, -1):
                if ((left >> i) << i) != left:
                    self._push(left >> i)
                if ((right >> i) << i) != right:
                    self._push((right-1) >> i)

            l2 = left
            r2 = right
            while left < right:
                if left & 1:
                    self._all_apply(left, f)
                    left += 1
                if right & 1:
                    right -= 1
                    self._all_apply(right, f)
                left >>= 1
                right >>= 1
            left = l2
            right = r2

            for i in range(1, self._log+1):
                if ((left >> i) << i) != left:
                    self._update(left >> i)
                if ((right >> i) << i) != right:
                    self._update((right-1) >> i)

    def max_right(self, left, g):
        if left == self._n:
            return self._n

        left += self._size
        for i in range(self._log, 0, -1):
            self._push(left >> i)

        sm = self._e
        first = True
        while first or (left & -left) != left:
            first = False
            while left%2 == 0:
                left >>= 1
            if not g(self._op(sm, self._d[left])):
                while left < self._size:
                    self._push(left)
                    left *= 2
                    if g(self._op(sm, self._d[left])):
                        sm = self._op(sm, self._d[left])
                        left += 1
                return left-self._size
            sm = self._op(sm, self._d[left])
            left += 1

        return self._n

    def min_left(self, right, g):
        if right == 0:
            return 0

        right += self._size
        for i in range(self._log, 0, -1):
            self._push((right-1) >> i)

        sm = self._e
        first = True
        while first or (right & -right) != right:
            first = False
            right -= 1
            while right > 1 and right%2:
                right >>= 1
            if not g(self._op(self._d[right], sm)):
                while right < self._size:
                    self._push(right)
                    right = 2*right+1
                    if g(self._op(self._d[right], sm)):
                        sm = self._op(self._d[right], sm)
                        right -= 1
                return right+1-self._size
            sm = self._op(self._d[right], sm)

        return 0

    def _update(self, k):
        self._d[k] = self._op(self._d[2*k], self._d[2*k+1])

    def _all_apply(self, k, f):
        self._d[k] = self._mapping(f, self._d[k])
        if k < self._size:
            self._lz[k] = self._composition(f, self._lz[k])

    def _push(self, k):
        self._all_apply(2*k, self._lz[k])
        self._all_apply(2*k+1, self._lz[k])
        self._lz[k] = self._id

n = II()
ss = LI()
cc = LI()
to = [[] for _ in range(n)]
for _ in range(n-1):
    u, v = LI1()
    to[u].append(v)
    to[v].append(u)

uu, depth, parent, top = [], [0]*n, [-1]*n, [0]*n
def heavy_light_decomposition(root=0):
    stack = [root]
    while stack:
        u = stack.pop()
        uu.append(u)
        for v in to[u]:
            depth[v] = depth[u]+1
            to[v].remove(u)
            parent[v] = u
            stack.append(v)
    size = [1]*n
    for u in uu[:0:-1]: size[parent[u]] += size[u]
    stack = [root]
    uu.clear()
    while stack:
        u = stack.pop()
        uu.append(u)
        if not to[u]: continue
        h = to[u][0]
        for v in to[u][1:]:
            if size[v] > size[h]: h, v = v, h
            stack.append(v)
            top[v] = v
        stack.append(h)
        top[h] = top[u]

def update(u, v):
    while top[u] != top[v]:
        if depth[top[u]] > depth[top[v]]: u, v = v, u
        i, j = utoi[top[v]], utoi[v]
        seg.apply(i,j+1,z)
        v = parent[top[v]]
    if depth[u] > depth[v]: u, v = v, u
    i, j = utoi[u], utoi[v]
    seg.apply(i,j+1,z)
    return

def get(u, v):
    res = 0
    while top[u] != top[v]:
        if depth[top[u]] > depth[top[v]]: u, v = v, u
        i, j = utoi[top[v]], utoi[v]
        res+=seg.prod(i,j+1)>>30
        res%=md
        v = parent[top[v]]
    if depth[u] > depth[v]: u, v = v, u
    i, j = utoi[u], utoi[v]
    res += seg.prod(i, j+1) >> 30
    res %= md
    return res

heavy_light_decomposition()
utoi = {u: i for i, u in enumerate(uu)}

def op(x, y):
    x1, x2 = divmod(x, 1 << 30)
    y1, y2 = divmod(y, 1 << 30)
    return (x1+y1)%md << 30 | (x2+y2)%md

# lazy(f)からtree(x)への操作
def mapping(f, x):
    s, e = divmod(x, 1 << 30)
    return (s+e*f%md)%md << 30 | e

# lazyの下への分解
def composition(f, g):
    return (f+g)%md

seg = LazySegTree(op, 0, mapping, composition, 0, [ss[u] << 30 | cc[u] for u in uu])

for _ in range(II()):
    t,*xy=LI()
    if t==0:
        x,y,z=xy
        x,y=x-1,y-1
        update(x,y)
    else:
        x,y=xy
        x,y=x-1,y-1
        print(get(x,y))