#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pll pair<int,int>
#define lowbit(x) (x&(-x))
typedef long long ll;
//typedef unsigned long long ull;
const int N = 1e6 + 10, M = 5e5, mod = 1e9+7;
const double eps=1e-11;
int n, m, k;
int res,ans;
int num[N],mp[N];


namespace Gra
{
	vector<pll> vt[N];
	int fa[N][30],dep[N];
	int sta[N],tot,pos[N];
	int lg[N];
	
	pll stl[N][20];

	void dfs(int id,int f)
	{
		sta[++tot]=id;
		pos[id]=tot;

		for(auto it:vt[id])
		{
			int j=it.fi;
			if(j==f) continue;
			dep[j]=dep[id]+it.se;
			dfs(j,id);
			sta[++tot]=id;
		}
	}
	
	void run()
	{
		dfs(1,-1);
		lg[0]=-1;
		for(int i=1;i<=tot;i++)
		{
			if(i&(i-1)==0) lg[i]=lg[i-1]+1;
			else lg[i]=lg[i-1];
			stl[i][0]={pos[sta[i]],sta[i]};
		}
		for(int i=1;i<lg[tot];i++)
		{
			for(int j=1;j+(1<<i)-1<=tot;j++)
			{
				stl[j][i]=min(stl[j][i-1],stl[j+(1<<i-1)][i-1]);
			}
		}
	}
	
	int lca(int l,int r)
	{
		l=pos[l],r=pos[r];
		int k=lg[r-l+1];
		return min(stl[l][k],stl[r-(1<<k)+1][k]).se;
	}
	
	int get(int l,int r)
	{
		if(pos[l]>pos[r]) swap(l,r);
		int lc=lca(l,r);
		return dep[l]+dep[r]-2*dep[lc];
	}


}
int L[N],R[N],lis[N];

bool check(int mid,int x,int k)
{
	if(mid==0) return 1;
	int dl=Gra::get(x,L[mid]),dr=Gra::get(x,R[mid]);
	//cout<<mid<<" "<<x<<" "<<k<<" "<<L[mid]<<" "<<R[mid]<<" "<<dl<<" "<<dr<<endl;
	return (dl<=k&&dr<=k);
}



void solve() {
	cin>>n>>m;
	vector<pll> vt;
	vt.push_back({-1,-1});
	int lim=m;
	for(int i=1;i<=n;i++)
	{
		cin>>num[i];
		vt.push_back({num[i],i});
	}
	sort(vt.begin(),vt.end());
	for(int i=1;i<n;i++)
	{
		int u,v,w;
		cin>>u>>v>>w;
		Gra::vt[u].push_back({v,w});
		Gra::vt[v].push_back({u,w});
	}
	Gra::run();

	for(int i=1;i<=m;i++)
	{
		if(vt[i].first!=vt[i-1].first+1)
		{
			lim=i-1;
			break;
		}

		if(i==1)
		{
			L[i]=R[i]=vt[i].se;
			continue;
		}

		int u=L[i-1],v=R[i-1];
		int dis=lis[i-1];
		int dl=Gra::get(u,vt[i].se),dr=Gra::get(v,vt[i].se);
		//cout<<u<<" "<<v<<" "<<dis<<" "<<dl<<" "<<dr<<" "<<vt[i].se<<endl;
		if(dl>=dr&&dl>dis) L[i]=L[i-1],R[i]=vt[i].se,lis[i]=dl;
		else if(dr>=dl&&dr>dis) L[i]=vt[i].se,R[i]=R[i-1],lis[i]=dr;
		else L[i]=L[i-1],R[i]=R[i-1],lis[i]=lis[i-1];
	}
	//cout<<lim<<"---"<<endl;
	//for(int i=1;i<=lim;i++) cout<<i<<" "<<vt[i].fi<<" "<<L[i]<<" "<<R[i]<<endl;

	while(m--)
	{
		int x,k;
		cin>>x>>k;
		int l=0,r=lim;
		while(l<r)
		{
			int mid=(l+r+1)>>1;
			if(check(mid,x,k)) l=mid;
			else r=mid-1;
		}

		cout<<vt[l].fi+1<<endl;
	}

}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int T;
	T = 1;
	//cin >> T;
	while (T--) solve();
	return 0;
}
/*
*/