#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
#define fir first
#define sec second
const int maxn=5e4+10;
const int maxB=55;
const int B=50;

int n,q;
ll a[maxn];
struct edge{
    int to,nxt;
}e[maxn<<1];
int head[maxn],cnt;
inline void add_edge(int u,int v){
    e[++cnt].to=v,e[cnt].nxt=head[u],head[u]=cnt;
    e[++cnt].to=u,e[cnt].nxt=head[v],head[v]=cnt;
}
int fa[maxn],dep[maxn],siz[maxn],son[maxn];
int top[maxn],ed[maxn],dfn[maxn],orddfn[maxn],dfncnt;
void dfs1(int u,int f,int d){
    fa[u]=f,dep[u]=d,siz[u]=1;
    for(int i=head[u],v;i;i=e[i].nxt){
        v=e[i].to;
        if(v==f) continue;
        dfs1(v,u,d+1);
        siz[u]+=siz[v];
        if(!son[u]||siz[v]>siz[son[u]]) son[u]=v;
    }
}
void dfs2(int u,int t){
    top[u]=t,ed[t]=u,dfn[u]=++dfncnt,orddfn[dfncnt]=u;
    if(!son[u]) return;
    dfs2(son[u],t);
    for(int i=head[u],v;i;i=e[i].nxt){
        v=e[i].to;
        if(v==fa[u]||v==son[u]) continue;
        dfs2(v,v);
    }
}
inline int get_LCA(int u,int v){
    while(top[u]!=top[v]){
        if(dep[top[u]]>dep[top[v]]) swap(u,v);
        v=fa[top[v]];
    }
    if(dep[u]>dep[v]) swap(u,v);
    return u;
}
inline int get_kthfa(int u,int k){
    if(k>dep[u]) return 0;
    while(1){
        if(dfn[u]-dfn[top[u]]<k){
            k-=(dfn[u]-dfn[top[u]]+1);
            u=fa[top[u]];
        }    
        else return orddfn[dfn[u]-k];
    }
}

int tot[maxn];
int ord[maxB][maxn],rk[maxB][maxn];
int L[maxB][maxB],R[maxB][maxB];
struct SegmentTree{
#define mid ((l+r)>>1)
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
    ll sum[maxn<<2];
    inline void push_up(int rt){
        sum[rt]=sum[rt<<1]+sum[rt<<1|1];
    }
    void build(int rt,int l,int r,int id){
        if(l==r) return sum[rt]=a[ord[id][l]],void();
        build(lson,id),build(rson,id);
        push_up(rt);
    }
    void update(int rt,int l,int r,int p,ll k){
        if(l==r) return sum[rt]=k,void();
        if(p<=mid) update(lson,p,k);
        else update(rson,p,k);
        push_up(rt);
    }
    ll query(int rt,int l,int r,int p){
        if(l==r) return sum[rt];
        if(p<=mid) return query(lson,p);
        else return query(rson,p);
    }
    ll query_range(int rt,int l,int r,int pl,int pr){
        if(pl<=l&&r<=pr) return sum[rt];
        ll res=0;
        if(pl<=mid) res+=query_range(lson,pl,pr);
        if(pr>mid) res+=query_range(rson,pl,pr);
        return res;
    }
#undef mid
#undef lson
#undef rson
}ST[maxB];
set<pii> S[maxB][maxn];

vector<int> ER;
inline void update1(int u,int lca,int k,int i,bool type){
    set<pii>::iterator it;
    while(top[u]!=top[lca]){
        it=S[k][top[u]].lower_bound(make_pair(i,0));
        while(it!=S[k][top[u]].end()&&(*it).fir==i&&(*it).sec<=dfn[u]){
            ll now=ST[1].query(1,1,n,rk[1][orddfn[(*it).sec]]);
            now=sqrt(now);
            for(int j=1;j<=B;++j) ST[j].update(1,1,n,rk[j][orddfn[(*it).sec]],now);
            if(now==1) ER.push_back(orddfn[(*it).sec]);
            ++it;
        }
        u=fa[top[u]];
    }
    if(!type) lca=fa[lca];
    it=S[k][top[u]].upper_bound(make_pair(i,dfn[lca]));
    while(it!=S[k][top[u]].end()&&(*it).fir==i&&(*it).sec<=dfn[u]){
        ll now=ST[1].query(1,1,n,rk[1][orddfn[(*it).sec]]);
        now=sqrt(now);
        for(int j=1;j<=B;++j) ST[j].update(1,1,n,rk[j][orddfn[(*it).sec]],now);
        if(now==1) ER.push_back(orddfn[(*it).sec]);
        ++it;
    }
    for(int u:ER){
        for(int j=1;j<=B;++j) S[j][top[u]].erase(make_pair(dep[u]%j,dfn[u]));
    }
    ER.clear();
}
inline void update_l(int u,int v,int k){
    int lca=get_LCA(u,v),dis=dep[u]+dep[v]-2*dep[lca];
    if((dep[u]-dep[lca])%k==0) update1(lca,lca,k,dep[lca]%k,0); 
    update1(u,lca,k,dep[u]%k,1);
    if(dis%k) update1(v,v,k,dep[v]%k,0);
    update1(v,lca,k,((2*dep[lca]-dep[u])%k+k)%k,1);
}
inline void update2(int u){
    ll now=ST[1].query(1,1,n,rk[1][u]);
    if(now==1) return;
    now=sqrt(now);
    for(int j=1;j<=B;++j) ST[j].update(1,1,n,rk[j][u],now);
    if(now!=1) return;
    for(int j=1;j<=B;++j) S[j][top[u]].erase(make_pair(dep[u]%j,dfn[u]));
}
inline void update_g(int u,int v,int k){
    int lca=get_LCA(u,v),dis=dep[u]+dep[v]-2*dep[lca];
    if((dep[u]-dep[lca])%k==0) update2(lca);
    while(dfn[u]>dfn[lca]){
        update2(u);
        u=get_kthfa(u,k);
    }
    if(dis%k){
        update2(v);
        v=get_kthfa(v,dis%k);
    }
    while(dfn[v]>dfn[lca]){
        update2(v);
        v=get_kthfa(v,k);
    }
}

inline ll query1(int u,int lca,int k,int i,bool type){
    // cerr<<"u:"<<u<<" lca:"<<lca<<" k:"<<k<<" i:"<<i<<endl;
    if(L[k][i]==-1) return 0;
    ll res=0;
    while(top[u]!=top[lca]){
        int l=L[k][i],r=R[k][i],lpos=-1,rpos=-1;
        // cerr<<l<<" "<<r<<endl;
        while(l<=r){
            int mid=(l+r)>>1;
            // cerr<<"lpos mid:"<<mid<<" "<<ord[k][mid]<<" "<<dfn[top[u]]<<endl;
            if(dfn[ord[k][mid]]>=dfn[top[u]]) lpos=mid,r=mid-1;
            else l=mid+1;
        }
        l=L[k][i],r=R[k][i];
        while(l<=r){
            int mid=(l+r)>>1;
            // cerr<<"rpos mid:"<<mid<<endl;
            if(dfn[ord[k][mid]]<=dfn[u]) rpos=mid,l=mid+1;
            else r=mid-1;
        }
        // cerr<<lpos<<" "<<rpos<<endl;
        if(lpos!=-1&&lpos<=rpos) res+=ST[k].query_range(1,1,n,lpos,rpos);
        u=fa[top[u]];
    }
    int l=L[k][i],r=R[k][i],lpos=-1,rpos=-1;
    // cerr<<"lca:"<<lca<<" u:"<<u<<endl;
    while(l<=r){
        int mid=(l+r)>>1;
        // cerr<<"lpos mid:"<<mid<<endl;
        if(dfn[ord[k][mid]]>=dfn[lca]) lpos=mid,r=mid-1;
        else l=mid+1;
    }
    l=L[k][i],r=R[k][i];
    while(l<=r){
        int mid=(l+r)>>1;
        // cerr<<"rpos mid:"<<mid<<endl;
        if(dfn[ord[k][mid]]<=dfn[u]) rpos=mid,l=mid+1;
        else r=mid-1;
    }
    // cerr<<lpos<<" "<<rpos<<endl;
    if(lpos!=-1&&type&&ord[k][lpos]==lca) ++lpos;
    if(lpos!=-1&&lpos<=rpos){
        res+=ST[k].query_range(1,1,n,lpos,rpos);
    }
    return res;
}
inline void query_l(int u,int v,int k){
    // cerr<<"u:"<<u<<" v:"<<v<<" k:"<<k<<endl;
    ll res=0;
    int lca=get_LCA(u,v),dis=dep[u]+dep[v]-2*dep[lca];
    if((dep[u]-dep[lca])%k==0) res+=query1(lca,lca,k,dep[lca]%k,0); 
    // cerr<<"res:"<<res<<endl;
    res+=query1(u,lca,k,dep[u]%k,1);
    // cerr<<"res:"<<res<<endl;
    if(dis%k) res+=query1(v,v,k,dep[v]%k,0);
    // cerr<<"res:"<<res<<endl;
    res+=query1(v,lca,k,((2*dep[lca]-dep[u])%k+k)%k,1);
    // cerr<<"res:"<<res<<endl;
    printf("%lld\n",res);
}
inline ll query2(int u){
    return ST[1].query(1,1,n,rk[1][u]);
}
inline void query_g(int u,int v,int k){
    // cerr<<"u:"<<u<<" v:"<<v<<" k:"<<k<<endl;
    ll res=0;
    int lca=get_LCA(u,v),dis=dep[u]+dep[v]-2*dep[lca];
    if((dep[u]-dep[lca])%k==0) res+=query2(lca);
    while(dfn[u]>dfn[lca]){
        res+=query2(u);
        // cerr<<"u:"<<u<<" res:"<<res<<endl;
        u=get_kthfa(u,k);
    }
    // cerr<<dep[u]<<" "<<dep[lca]<<endl;
    // cerr<<(dep[u]-dep[lca])%k<<endl;
    // cerr<<"res:"<<res<<endl;
    if(dis%k){
        res+=query2(v);
        v=get_kthfa(v,dis%k);
    }
    // cerr<<"res:"<<res<<endl;
    while(dfn[v]>dfn[lca]){
        res+=query2(v);
        // cerr<<"v:"<<v<<" res:"<<res<<endl;
        v=get_kthfa(v,k);
    }
    printf("%lld\n",res);
}

int main(){
    // freopen("d.in","r",stdin);
    // freopen("d.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;++i) scanf("%lld",&a[i]);
    for(int i=1,u,v;i<n;++i){
        scanf("%d%d",&u,&v);
        add_edge(u,v);
    }
    dfs1(1,0,0);
    dfs2(1,1);
    // for(int i=1;i<=n;++i) cerr<<"i:"<<i<<" fa:"<<fa[i]<<" top:"<<top[i]<<" dfn:"<<dfn[i]<<endl;
    for(int k=1;k<=B;++k){
        for(int i=0;i<k;++i) tot[i]=0,L[k][i]=R[k][i]=-1;
        for(int i=1;i<=n;++i) ++tot[dep[orddfn[i]]%k];
        for(int i=1;i<k;++i) tot[i]+=tot[i-1];
        for(int i=n;i>=1;--i) ord[k][tot[dep[orddfn[i]]%k]--]=orddfn[i];
        for(int i=1;i<=n;++i) rk[k][ord[k][i]]=i;
        for(int i=1;i<=n;++i){
            if(i==1||dep[ord[k][i]]%k!=dep[ord[k][i-1]]%k) L[k][dep[ord[k][i]]%k]=i;
            R[k][dep[ord[k][i]]%k]=i;
        }
        ST[k].build(1,1,n,k);
        for(int u=1;u<=n;++u) S[k][top[u]].insert(make_pair(dep[u]%k,dfn[u]));
        if(k>n) continue;
        // cerr<<"k:"<<k<<endl;
        // cerr<<"ord:"<<endl;
        // for(int i=1;i<=n;++i) cerr<<ord[k][i]<<" ";
        // cerr<<endl;
        // cerr<<"rk:"<<endl;
        // for(int i=1;i<=n;++i) cerr<<rk[k][i]<<" ";
        // cerr<<endl;
        // for(int i=0;i<k;++i) cerr<<"["<<L[k][i]<<","<<R[k][i]<<"] ";
        // cerr<<endl;
    }
    scanf("%d",&q);
    while(q--){
        int opt,u,v,k;
        scanf("%d%d%d%d",&opt,&u,&v,&k);
        if(!opt){
            if(k<=B) update_l(u,v,k);
            else update_g(u,v,k);
        }
        else{
            if(k<=B) query_l(u,v,k);
            else query_g(u,v,k);
        }
    }
    return 0;
}