You are given a weighted tree (undirected connected graph with no cycles, loops or multiple edges) with n vertices. The edge \\{u_j, v_j\} has weight w_j. Also each vertex i has its own value a_i assigned to it.

Let's call a path starting in vertex u and ending in vertex v, where each edge can appear no more than twice (regardless of direction), a 2-path. Vertices can appear in the 2-path multiple times (even start and end vertices).

For some 2-path p profit Pr(p) = ∑_{v ∈ distinct vertices in  p}{a_v} - ∑_{e ∈ distinct edges in  p}{k_e ⋅ w_e}, where k_e is the number of times edge e appears in p. That is, vertices are counted once, but edges are counted the number of times they appear in p.

You are about to answer m queries. Each query is a pair of vertices (qu, qv). For each query find 2-path p from qu to qv with maximal profit Pr(p).

Input

The first line contains two integers n and q (2 ≤ n ≤ 3 ⋅ 10^5, 1 ≤ q ≤ 4 ⋅ 10^5) — the number of vertices in the tree and the number of queries.

The second line contains n space-separated integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9) — the values of the vertices.

Next n - 1 lines contain descriptions of edges: each line contains three space separated integers u_i, v_i and w_i (1 ≤ u_i, v_i ≤ n, u_i ≠ v_i, 1 ≤ w_i ≤ 10^9) — there is edge \\{u_i, v_i\} with weight w_i in the tree.

Next q lines contain queries (one per line). Each query contains two integers qu_i and qv_i (1 ≤ qu_i, qv_i ≤ n) — endpoints of the 2-path you need to find.

Output

For each query print one integer per line — maximal profit Pr(p) of the some 2-path p with the corresponding endpoints.

Example

Input

7 6
6 5 5 3 2 1 2
1 2 2
2 3 2
2 4 1
4 5 1
6 4 2
7 3 25
1 1
4 4
5 6
6 4
3 4
3 7


Output

9
9
9
8
12
-14

Note

Explanation of queries: 

  1. (1, 1) — one of the optimal 2-paths is the following: 1 → 2 → 4 → 5 → 4 → 2 → 3 → 2 → 1. Pr(p) = (a_1 + a_2 + a_3 + a_4 + a_5) - (2 ⋅ w(1,2) + 2 ⋅ w(2,3) + 2 ⋅ w(2,4) + 2 ⋅ w(4,5)) = 21 - 2 ⋅ 12 = 9. 
  2. (4, 4): 4 → 2 → 1 → 2 → 3 → 2 → 4. Pr(p) = (a_1 + a_2 + a_3 + a_4) - 2 ⋅ (w(1,2) + w(2,3) + w(2,4)) = 19 - 2 ⋅ 10 = 9. 
  3. (5, 6): 5 → 4 → 2 → 3 → 2 → 1 → 2 → 4 → 6. 
  4. (6, 4): 6 → 4 → 2 → 1 → 2 → 3 → 2 → 4. 
  5. (3, 4): 3 → 2 → 1 → 2 → 4. 
  6. (3, 7): 3 → 2 → 1 → 2 → 4 → 5 → 4 → 2 → 3 → 7. 
#include <bits/stdc++.h>
using namespace std;
const int N = 300000 + 7;
int n, q;
long long val[N];
struct edge {
  int to, nex;
  long long wei;
} e[N << 1];
int fir[N], eid;
int siz[N], dep[N], fa[N], son[N], ltp[N];
long long faw[N];
int dfn[N], inx;
long long f[N], g[N];
long long bit[N];
void addedge(int u, int v, int w);
void dfs1(int s);
void dfs2(int s);
void dfs3(int s, long long up);
void build();
int lca(int x, int y);
long long get(int x, int z);
void add(int i, long long v);
long long sum(int i);
int main() {
  scanf("%d%d", &n, &q);
  for (int i = 1; i <= n; ++i) scanf("%lld", val + i);
  for (int i = 1, u, v, w; i < n; ++i)
    scanf("%d%d%d", &u, &v, &w), addedge(u, v, w), addedge(v, u, w);
  dfs1(1);
  ltp[1] = 1;
  dfs2(1);
  dfs3(1, 0);
  build();
  for (int x, y, z; q; --q) {
    scanf("%d%d", &x, &y);
    if (x == y)
      printf("%lld\n", g[x]);
    else
      z = lca(x, y), printf("%lld\n", g[z] + get(x, z) + get(y, z));
  }
  return 0;
}
void addedge(int u, int v, int w) {
  e[++eid] = (edge){v, fir[u], 1ll * w};
  fir[u] = eid;
}
void dfs1(int s) {
  siz[s] = 1;
  f[s] = val[s];
  for (int i = fir[s]; i; i = e[i].nex) {
    if (e[i].to == fa[s]) continue;
    fa[e[i].to] = s;
    faw[e[i].to] = e[i].wei;
    dep[e[i].to] = dep[s] + 1;
    dfs1(e[i].to);
    siz[s] += siz[e[i].to];
    son[s] = siz[e[i].to] > siz[son[s]] ? e[i].to : son[s];
    f[s] += max(0ll, f[e[i].to] - 2 * e[i].wei);
  }
}
void dfs2(int s) {
  dfn[s] = ++inx;
  if (!son[s]) return;
  ltp[son[s]] = ltp[s];
  dfs2(son[s]);
  for (int i = fir[s]; i; i = e[i].nex)
    if (e[i].to != fa[s] && e[i].to != son[s])
      ltp[e[i].to] = e[i].to, dfs2(e[i].to);
}
void dfs3(int s, long long up) {
  g[s] = f[s] + max(0ll, up);
  for (int i = fir[s]; i; i = e[i].nex)
    if (e[i].to != fa[s])
      dfs3(e[i].to, g[s] - max(0ll, f[e[i].to] - 2 * e[i].wei) - 2 * e[i].wei);
}
void build() {
  for (int i = 1; i <= n; ++i)
    add(dfn[i], f[i] - max(0ll, f[i] - 2 * faw[i]) - faw[i]);
}
int lca(int x, int y) {
  for (; ltp[x] != ltp[y]; x = fa[ltp[x]])
    if (dep[ltp[x]] < dep[ltp[y]]) swap(x, y);
  return dep[x] < dep[y] ? x : y;
}
long long get(int x, int z) {
  long long t = 0;
  for (; ltp[x] != ltp[z]; x = fa[ltp[x]])
    t += sum(dfn[x]) - sum(dfn[ltp[x]] - 1);
  return t + sum(dfn[x]) - sum(dfn[z]);
}
void add(int i, long long v) {
  for (; i <= n; i += i & -i) bit[i] += v;
}
long long sum(int i) {
  long long t = 0;
  for (; i; i -= i & -i) t += bit[i];
  return t;
}
