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

namespace FastIO
{

class FastIOBase
{
 protected:
#ifdef OPENIOBUF
	static const int BUFSIZE=1<<22;
	char buf[BUFSIZE+1];
	int buf_p=0;
#endif
	FILE *target;
 public:
#ifdef OPENIOBUF
	virtual void flush()=0;
#endif
	FastIOBase(FILE *f): target(f){}
	~FastIOBase()=default;
};

class FastOutput: public FastIOBase
{
#ifdef OPENIOBUF
 public:
	inline void flush()
		{ fwrite(buf,1,buf_p,target),buf_p=0; }
#endif
 protected:
	inline void __putc(char x)
	{
#ifdef OPENIOBUF
		if(buf[buf_p++]=x,buf_p==BUFSIZE)flush();
#else
		putc(x,target);
#endif
	}
	template<typename T>
	inline void __write(T x)
	{
		static char stk[64],*top;top=stk;
		if(x<0) return __putc('-'),__write(-x);
		do *(top++)=x%10,x/=10; while(x);
		for(;top!=stk;__putc(*(--top)+'0'));
	}
 public:
	FastOutput(FILE *f=stdout): FastIOBase(f){}
#ifdef OPENIOBUF
	inline void setTarget(FILE *f) { this->flush(),target=f; }
	~FastOutput(){ flush(); }
#else
	inline void setTarget(FILE *f) { target=f; }
#endif
	template<typename ...T>
	inline void writesp(const T &...x)
		{ initializer_list<int>{(this->operator<<(x),__putc(' '),0)...}; }
	template<typename ...T>
	inline void writeln(const T &...x)
		{ initializer_list<int>{(this->operator<<(x),__putc('\n'),0)...}; }
	inline FastOutput &operator <<(char x)
		{ return __putc(x),*this; }
	inline FastOutput &operator <<(const char *s)
		{ for(;*s;__putc(*(s++)));return *this; }
	inline FastOutput &operator <<(const string &s)
		{ return (*this)<<s.c_str(); }
	template<typename T,typename=typename enable_if<is_integral<T>::value>::type>
	inline FastOutput &operator <<(const T &x)
		{ return __write(x),*this; }
}qout;

class FastInput: public FastIOBase
{
#ifdef OPENIOBUF
 public:
	inline void flush()
		{ buf[fread(buf,1,BUFSIZE,target)]='\0',buf_p=0; }
#endif
 protected:
	inline char __getc()
	{
#ifdef OPENIOBUF
		if(buf_p==BUFSIZE) flush();
		return buf[buf_p++];
#else
		return getc(target);
#endif
	}
 public:
#ifdef OPENIOBUF
	FastInput(FILE *f=stdin): FastIOBase(f){ buf_p=BUFSIZE; }
	inline void setTarget(FILE *f) { this->flush(),target=f; }
#else
	FastInput(FILE *f=stdin): FastIOBase(f){}
	inline void setTarget(FILE *f) { target=f; }
#endif
	inline char getchar() { return __getc(); }
	template<typename ...T>
	inline void read(T &...x)
		{ initializer_list<int>{(this->operator>>(x),0)...}; }
	inline FastInput &operator >>(char &x)
		{ while(isspace(x=__getc()));return *this; }
	template<typename T,typename=typename enable_if<is_integral<T>::value>::type>
	inline FastInput &operator >>(T &x)
	{
		static char ch,sym;x=sym=0;
		while(isspace(ch=__getc()));
		if(ch=='-') sym=1,ch=__getc();
		for(;isdigit(ch);x=(x<<1)+(x<<3)+(ch^48),ch=__getc());
		return sym?x=-x:x,*this;
	}
	inline FastInput &operator >>(char *s)
	{
		while(isspace(*s=__getc()));
		for(;!isspace(*s) && *s && ~*s;*(++s)=__getc());
		return *s='\0',*this;
	}
	inline FastInput &operator >>(string &s)
	{
		char str_buf[(1<<8)+1],*p=str_buf;
		char *const buf_end=str_buf+(1<<8);
		while(isspace(*p=__getc()));
		for(s.clear(),p++;;p=str_buf)
		{
			for(;p!=buf_end && !isspace(*p=__getc()) && *p && ~*p;p++);
			*p='\0',s.append(str_buf);
			if(p!=buf_end) break;
		}
		return *this;
	}
}qin;

} // namespace FastIO
using namespace FastIO;

using LL=long long;
using LD=long double;
using UI=unsigned int;
using ULL=unsigned long long;

#ifndef DADALZY
#define FILEIO(file) freopen(file".in","r",stdin),freopen(file".out","w",stdout)
#else
#define FILEIO(file)
#endif

int n,m,q,nn,a[20],lsh[200005],qs[200005],qe[200005];
LL dis[20][20],f[1<<18][20],g[1<<18];
#define ppc(x) __builtin_popcount(x)
#define ctz(x) __builtin_ctz(x)
struct Line
{
	LL k,b;
	Line(): k(0),b(0){}
	Line(LL _k,LL _b): k(_k),b(_b){}
	inline LL operator ()(LL x)const { return k*x+b; }
};
struct TreeNode{ Line val;int lc,rc; }t[400005*18];
int cnt,rt[20];
#define LC t[i].lc
#define RC t[i].rc
void modify(const Line &f,int &i,int l=1,int r=nn)
{
	if(!i) i=++cnt;
	LL fl=f(lsh[l]),fr=f(lsh[r]),
	   tl=t[i].val(lsh[l]),tr=t[i].val(lsh[r]);
	int mid=(l+r)>>1;
	if(fl>=tl && fr>=tr) t[i].val=f;
	else if(fl<=tl && fr<=tr) return;
	else modify(f,LC,l,mid),modify(f,RC,mid+1,r);
}
LL query(int p,int i,int l=1,int r=nn)
{
	LL res=t[i].val(lsh[p]);
	if(l==r) return res;
	int mid=(l+r)>>1;
	if(mid>=p) res=max(res,query(p,LC,l,mid));
	else res=max(res,query(p,RC,mid+1,r));
	return res;
}
int main()
{
	qin>>n>>m;
	memset(dis,0x3f,sizeof(dis));
	memset(f,-0x3f,sizeof(f));
	for(int i=1;i<=n;i++)
		qin>>a[i],dis[i][i]=0,f[1<<(i-1)][i]=0;
	for(int i=1,u,v,w;i<=m;i++)
		qin>>u>>v>>w,dis[u][v]=w;
	for(int k=1;k<=n;k++)
		for(int i=1;i<=n;i++)
			for(int j=1;j<=n;j++)
				dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
	qin>>q;
	for(int i=1;i<=q;i++)
		qin>>qs[i]>>qe[i],lsh[++nn]=qs[i];
	sort(lsh+1,lsh+nn+1);
	nn=unique(lsh+1,lsh+nn+1)-lsh-1;
	for(int S=0;S<(1<<n);S++)
	{
		if(S) g[S]=g[S-(S&-S)]+a[ctz(S)+1];
		for(int u=1;u<=n;u++)
		{
			if(!(S&(1<<(u-1)))) continue;
			modify(Line(g[S],f[S][u]),rt[u]);
			for(int v=1;v<=n;v++)
			{
				if(S&(1<<(v-1))) continue;
				if(dis[u][v]==dis[0][0]) continue;
				int T=S|(1<<(v-1));
				f[T][v]=max(f[T][v],f[S][u]-g[S]*dis[u][v]);
			}
		}
	}
	for(int i=1;i<=q;i++)
	{
		int x=lower_bound(lsh+1,lsh+nn+1,qs[i])-lsh;
		qout.writeln(query(x,rt[qe[i]]));
	}
	return 0;
}