#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
const int N=500005;
struct edge
{
	int u,v,a;
}edg[N];
int n,m,q,k;
int hd[N],nt[N<<1],e[N<<1],w[N],idx,siz[N],x,f[N],fa[N][22],val[N];
ll mn[N],p[N],INF;
char ch;
inline void read(int &x){x=0;ch=getchar();while(ch<48||ch>57)ch=getchar();while(ch>47&&ch<58)x=(x<<3)+(x<<1)+(ch^48),ch=getchar();}
inline void add(int x,int y){nt[++idx]=hd[x],hd[x]=idx,e[idx]=y;}
inline bool cmp1(edge a,edge b){return a.a>b.a;}
inline int find(int x)
{
	if(x==f[x]) return x;
	return f[x]=find(f[x]);
}
void DFS(int cur,int lst)
{
	fa[cur][0]=lst;
	mn[cur]=p[cur];
	if(p[cur]!=INF) siz[cur]=1;
	for(int i=1;i<=19;++i) fa[cur][i]=fa[fa[cur][i-1]][i-1];
	for(int i=hd[cur];i;i=nt[i])
		if(e[i]!=lst)
		{
			DFS(e[i],cur);
			mn[cur]=min(mn[cur],mn[e[i]]);
			siz[cur]+=siz[e[i]];
		}
	return ;
}
void query(int p,int s)
{
	int c=p;
	for(int i=19;i>=0;--i)
		if(val[fa[c][i]]>=s) c=fa[c][i];
	printf("%d %lld\n",siz[c],mn[c]); 
	x=mn[c];
	return ; 
 } 
int main()
{
	freopen("Xen.in","r",stdin);
	freopen("Xen.out","w",stdout);
	memset(mn,0x3f,sizeof(mn));
	INF=mn[0];
	read(n),read(m);
	for(int i=1;i<=m;++i) read(edg[i].u),read(edg[i].v),read(edg[i].a);
	for(int i=1,k;i<=n;++i) read(k),p[i]=k;
	sort(edg+1,edg+1+m,cmp1);
	int tot=n;
	for(int i=1;i<=2*n;++i) f[i]=i;
	for(int i=1;i<=m;++i)
	{
		int x=edg[i].u,y=edg[i].v;
		int fx=find(f[x]),fy=find(f[y]);
		if(fx!=fy)
		{
			++tot;
			add(fx,tot),add(tot,fx);
			add(fy,tot),add(tot,fy);
			val[tot]=edg[i].a;
			p[tot]=INF; 
			f[fx]=f[fy]=tot;
		}
		if(tot==2*n-1) break;
	}
	int rt=find(1);
	DFS(rt,0);
	scanf("%d%d",&q,&k);
	int p0,s0,mod;
	for(int i=1;i<=q;++i)
	{
		scanf("%d%d%d",&p0,&s0,&mod);
		query((p0+k*x)%n+1,(s0+k*x)%mod);
	}
	return 0;
}