// bzoj4012#include<algorithm>#include<iostream>#include<cstdlib>#include<cstring>#include<cstdio>#include<vector>#include<cmath>#define LL long long#define inf 1ll<<30#define Pi acos(-1.0)#define free(a) freopen(a".in","r",stdin),freopen(a".out","w",stdout);using namespace std;const int maxn=200010;int n,head[maxn],a[maxn],par[maxn],len[maxn],bin[30];int L,R,U,Q,A;struct edge {int to,next,w;}e[maxn<<1];struct data {	int num;LL w;	friend bool operator < (const data a,const data b) {		return a.num<b.num;	}};vector<data> c[maxn],t[maxn];namespace LittleTrick {	int fa[maxn][30],deep[maxn],cnt;	LL d[maxn];	void link(int u,int v,int w) {		e[++cnt]=(edge){v,head[u],w};head[u]=cnt;		e[++cnt]=(edge){u,head[v],w};head[v]=cnt;	}	void dfs(int x) {		for (int i=1;i<=20;i++) fa[x][i]=fa[fa[x][i-1]][i-1];		for (int i=head[x];i;i=e[i].next) if (e[i].to!=fa[x][0]) {				deep[e[i].to]=deep[x]+1;				d[e[i].to]=d[x]+e[i].w;				fa[e[i].to][0]=x;				dfs(e[i].to);			}	}	int lca(int x,int y) {		if (deep[x]<deep[y]) swap(x,y);		int t=deep[x]-deep[y];		for (int i=0;bin[i]<=t;i++) if (bin[i]&t) x=fa[x][i];		for (int i=20;i>=0;i--) if (fa[x][i]!=fa[y][i]) x=fa[x][i],y=fa[y][i];		return x==y ? x : fa[x][0];	}	LL dis(int x,int y) {		return d[x]+d[y]-2*d[lca(x,y)];	}}using namespace LittleTrick;namespace NodeDivide {	int size[maxn],f[maxn],vis[maxn],sum,Dargen;		void caldargen(int x,int fa) {		size[x]=1,f[x]=0;		for (int i=head[x];i;i=e[i].next) if (e[i].to!=fa && !vis[e[i].to]) {				caldargen(e[i].to,x);				size[x]+=size[e[i].to];				f[x]=max(f[x],size[e[i].to]);			}		f[x]=max(f[x],sum-size[x]);		if (f[x]<f[Dargen]) Dargen=x;	}	void caldeep(int x,int fa,int p) {		c[p].push_back((data){a[x],dis(x,p)});		t[p].push_back((data){a[x],par[p] ? dis(x,par[p]) : 0}); 		for (int i=head[x];i;i=e[i].next)			if (e[i].to!=fa && !vis[e[i].to]) caldeep(e[i].to,x,p);	}	void work(int x) {		vis[x]=1;		t[x].push_back((data){-1,0});t[x].push_back((data){inf,0});   //方便二分查找，不用特判了		c[x].push_back((data){-1,0});c[x].push_back((data){inf,0});		caldeep(x,0,x);		for (int i=head[x];i;i=e[i].next) if (!vis[e[i].to]) {				Dargen=0;sum=size[e[i].to];				caldargen(e[i].to,x);				par[Dargen]=x;				work(Dargen);			}		sort(t[x].begin(),t[x].end());len[x]=t[x].size();		sort(c[x].begin(),c[x].end());len[x]=c[x].size();		for (int i=1;i<len[x];i++) t[x][i].w+=t[x][i-1].w;		for (int i=1;i<len[x];i++) c[x][i].w+=c[x][i-1].w;	}	void Init() {		f[Dargen=0]=inf;sum=n;		caldargen(1,0);		work(Dargen);	}}using namespace NodeDivide;namespace Query {	int Lower_bound(int x) {		int l=0,r=len[x],res;		while (l<=r) {			int mid=(l+r)>>1;			if (c[x][mid].num<L) res=mid,l=mid+1;			else r=mid-1;		}		return res;	}	int Upper_bound(int x) {		int l=0,r=len[x],res;		while (l<=r) {			int mid=(l+r)>>1;			if (c[x][mid].num<=R) res=mid,l=mid+1;			else r=mid-1;		}		return res;	}	LL query(int x,int tag) {		LL d1=dis(x,U),res=0;		LL l=Lower_bound(x),r=Upper_bound(x);		res+=(c[x][r].w-c[x][l].w)+(r-l-tag)*d1;		res-=(t[x][r].w-t[x][l].w);		if (!par[x]) return res;		return res+query(par[x],r-l);	}}using namespace Query;int main() {	bin[0]=1;for (int i=1;i<=20;i++) bin[i]=bin[i-1]<<1;	scanf("%d%d%d",&n,&Q,&A);	for (int i=1;i<=n;i++) scanf("%d",&a[i]);	for (int u,v,w,i=1;i<n;i++) {		scanf("%d%d%d",&u,&v,&w);		link(u,v,w);	}	dfs(1);	Init();	LL ans=0;	for (int a,b,i=1;i<=Q;i++) {		scanf("%d%d%d",&U,&a,&b);		if (i==1) L=min(a%A,b%A),R=max(a%A,b%A);		else L=min((a+ans)%A,(b+ans)%A),R=max((a+ans)%A,(b+ans)%A);		printf("%lld\n",ans=query(U,0));	}	return 0;}