// 那就是希望。
// 即便需要取模，也是光明。

#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
// Heaven and Earth... My guiding star...
// Akira Complex R.I.P.
ullt SQRT(ullt v)
{
    ullt w=sqrtl((long double)v);
    while(w*w<v)w++;
    while(w*w>v)w--;
    return w;
}
const uint B=8,Lim=50000;
std::vector<uint>Way[Lim+1];
uint T[Lim+1],F[Lim+1],Rot[Lim+1],Dep[Lim+1];ullt A[Lim+1],U[Lim+1];
uint Bgn[B+1][Lim+1],End[B+1][Lim+1],n,q;
voi dfs(uint p,uint f)
{
    std::vector<uint>S;T[p]=1;
    for(auto&s:Way[p])if(s!=f){S.push_back(s),dfs(s,p),T[p]+=T[s];if(T[s]>T[S[0]])std::swap(S[0],S.back());}
    Way[p]=S;
}
voi dfs2(uint p)
{
    static uint cnt=0,Cnt[B+1][B+1];A[T[p]=cnt++]=U[p];
    for(uint i=1;i<=B;i++)Bgn[i][T[p]]=Cnt[i][Dep[T[p]]%i]++;
    for(auto s:Way[p])Rot[cnt]=s==Way[p][0]?Rot[T[p]]:cnt,F[cnt]=T[p],Dep[cnt]=Dep[T[p]]+1,dfs2(s);
    for(uint i=1;i<=B;i++)End[i][T[p]]=Cnt[i][Dep[T[p]]%i];
    if(!p)for(uint i=1;i<=B;i++)
    {
        for(uint j=1;j<i;j++)Cnt[i][j]+=Cnt[i][j-1];
        for(uint j=0;j<n;j++)if(Dep[j]%i)Bgn[i][j]+=Cnt[i][Dep[j]%i-1],End[i][j]+=Cnt[i][Dep[j]%i-1];
    }
}
uint kth(uint p,uint k)
{
    if(Dep[p]<k)return-1;
    while(p-Rot[p]<k)k-=p-Rot[p]+1,p=F[Rot[p]];
    return p-k;
}
uint lca(uint u,uint v)
{
    while(Rot[u]!=Rot[v])
    {
        if(Rot[u]<Rot[v])std::swap(u,v);
        u=F[Rot[u]];
    }
    return u<v?u:v;
}
namespace Block
{
    const uint T=200;
    ullt A[B+1][Lim+1],S[B+1][Lim/T+1];
    inline voi add(uint c,uint l,uint r,ullt w){A[c][l]+=w,S[c][l/T]+=w,A[c][r]-=w,S[c][r/T]-=w;}
    ullt find(uint c,uint p)
    {
        ullt ans=0;p++;
        for(uint i=p/T-1;~i;i--)ans+=S[c][i];
        for(uint i=p/T*T;i<p;i++)ans+=A[c][i];
        return ans;
    }
}
voi upd(uint p)
{
    if(A[p]==1)return;
    ullt g=SQRT(A[p])-A[p];A[p]+=g;
    for(uint i=1;i<=B;i++)Block::add(i,Bgn[i][p],End[i][p],g);
}
uint kRot[B+1][Lim+1];
uint getf(uint p,uint k)
{
    if(~kRot[k][p]&&A[kRot[k][p]]==1)kRot[k][p]=getf(kRot[k][p],k);
    return kRot[k][p];
}
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    freopen("QAQ.out","w",stdout);
#endif
    scanf("%u",&n);for(uint i=0;i<n;i++)scanf("%llu",U+i);
    for(uint i=1,u,v;i<n;i++)scanf("%u%u",&u,&v),Way[--u].push_back(--v),Way[v].push_back(u);
    dfs(0,-1),dfs2(0),F[0]=-1;
    for(uint i=1;i<=B;i++)for(uint p=0;p<n;p++)kRot[i][p]=kth(p,i),Block::add(i,Bgn[i][p],End[i][p],A[p]);
    scanf("%u",&q);
    while(q--)
    {
        uint o,u,v,r,k;scanf("%u%u%u%u",&o,&u,&v,&k),r=lca(u=T[u-1],v=T[v-1]);
        if(o)
        {
            ullt ans=0;
            if((Dep[u]+Dep[v]-2*Dep[r])%k)
            {
                ans=A[v];
                if(Dep[v]-Dep[r]>=(Dep[u]+Dep[v]-2*Dep[r])%k)v=kth(v,(Dep[u]+Dep[v]-2*Dep[r])%k);
                else r=v=kth(u,(Dep[u]+Dep[v]-2*Dep[r])/k*k);
            }
            if(k<=B)
            {
                if(Dep[u]-Dep[r]>=k)
                    ans+=Block::find(k,Bgn[k][u]),ans-=Block::find(k,Bgn[k][u=kth(u,(Dep[u]-Dep[r])/k*k)]);
                ans+=A[u];
                if(v!=r)
                {
                    if(Dep[v]-Dep[r]>k)
                        ans+=Block::find(k,Bgn[k][v]),ans-=Block::find(k,Bgn[k][v=kth(v,(Dep[v]-Dep[r]-1)/k*k)]);
                    ans+=A[v];
                }
            }
            else
            {
                while(true)
                {
                    ans+=A[u];if(Dep[u]-Dep[r]<k)break;
                    u=kth(u,k);
                }
                if(v!=r)while(true)
                {
                    ans+=A[v];if(Dep[v]-Dep[r]<=k)break;
                    v=kth(v,k);
                }
            }
            printf("%llu\n",ans);
        }
        else
        {
            if((Dep[u]+Dep[v]-2*Dep[r])%k)
            {
                upd(v);
                if(Dep[v]-Dep[r]>=(Dep[u]+Dep[v]-2*Dep[r])%k)v=kth(v,(Dep[u]+Dep[v]-2*Dep[r])%k);
                else r=v=kth(u,(Dep[u]+Dep[v]-2*Dep[r])/k*k);
            }
            while(true)
            {
                upd(u);if(Dep[u]-Dep[r]<k)break;
                if(k<=B)
                {
                    uint t=getf(u,k);
                    if(!~t||Dep[t]<Dep[r])t=kth(u,(Dep[u]-Dep[r])/k*k);
                    u=t;
                }else u=kth(u,k);
            }
            if(v!=r)while(true)
            {
                upd(v);if(Dep[v]-Dep[r]<=k)break;
                if(k<=B)
                {
                    uint t=getf(v,k);
                    if(!~t||Dep[t]<=Dep[r])t=kth(v,(Dep[v]-Dep[r]-1)/k*k);
                    v=t;
                }else v=kth(v,k);
            }
        }
    }
    return 0;
}

// 那就是希望。
// 即便需要取模，也是光明。