Problem: 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. 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
const int N = 3e5 + 5;
struct Query {
  int u, v, lca;
  long long ans;
};
int n, m, depth[N], par[N][20];
long long dp[N], val[N], a[N], bit[N];
std::vector<std::pair<int, int> > g[N];
std::vector<int> q[N];
std::vector<Query> ans;
std::map<std::pair<int, int>, long long> dto;
void add(int x, long long val) {
  for (; x <= n; x += x & -x) bit[x] += val;
}
long long sum(int x) {
  long long res = 0;
  for (; x; x -= x & -x) res += bit[x];
  return res;
}
void dfs1(int u, int fa, int dep) {
  par[u][0] = fa;
  depth[u] = dep;
  dp[u] = a[u];
  for (std::pair<int, int> &v : g[u]) {
    if (v.first == fa) continue;
    dfs1(v.first, u, dep + 1);
    dp[u] += std::max(0LL, dp[v.first] - 2LL * v.second);
    dto[std::pair<int, int>(u, v.first)] =
        std::max(0LL, dp[v.first] - 2LL * v.second);
  }
}
void dfs2(int u, int fa) {
  for (std::pair<int, int> &v : g[u]) {
    if (v.first == fa) continue;
    dp[u] -= dto[std::pair<int, int>(u, v.first)];
    dp[v.first] += std::max(0LL, dp[u] - 2LL * v.second);
    dto[std::pair<int, int>(v.first, u)] =
        std::max(0LL, dp[u] - 2LL * v.second);
    dfs2(v.first, u);
    dp[u] += dto[std::pair<int, int>(u, v.first)];
  }
}
void pr() {
  int k = 0;
  while (1 << (k + 1) <= n) k++;
  for (int i = 1; i <= k; i++)
    for (int j = 1; j <= n; j++) par[j][i] = par[par[j][i - 1]][i - 1];
}
int LCA(int u, int v) {
  if (depth[u] < depth[v]) std::swap(u, v);
  int t = depth[u] - depth[v];
  for (int i = 0; 1 << i <= t; i++)
    if (t >> i & 1) u = par[u][i];
  if (u == v) return u;
  for (int i = 19; ~i; i--)
    if (par[u][i] != par[v][i]) u = par[u][i], v = par[v][i];
  return par[u][0];
}
void dfs3(int u, int fa) {
  long long tmp = dto[std::pair<int, int>(u, fa)];
  add(depth[u], dp[u] - tmp - val[depth[u]]);
  val[depth[u]] = dp[u] - tmp;
  for (int v : q[u]) {
    int lca = ans[v].lca;
    ans[v].ans += sum(depth[u]) - sum(depth[lca] - 1);
  }
  for (std::pair<int, int> &v : g[u]) {
    if (v.first == fa) continue;
    tmp = dto[std::pair<int, int>(u, v.first)] + v.second;
    add(depth[u], -tmp);
    dfs3(v.first, u);
    add(depth[u], tmp);
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%lld", a + i);
  int u, v, w;
  for (int i = 1; i < n; i++) {
    scanf("%d%d%d", &u, &v, &w);
    g[u].push_back(std::pair<int, int>(v, w));
    g[v].push_back(std::pair<int, int>(u, w));
  }
  dfs1(1, 0, 1);
  dfs2(1, 0);
  pr();
  while (m--) {
    scanf("%d%d", &u, &v);
    int lca = LCA(u, v);
    if (lca != u) q[u].push_back(int(ans.size()));
    if (lca != v) q[v].push_back(int(ans.size()));
    ans.push_back((Query){u, v, lca, 0});
  }
  dfs3(1, 0);
  for (Query &t : ans) {
    if (t.u == t.v)
      t.ans = dp[t.u];
    else if (t.lca != t.u && t.lca != t.v)
      t.ans -= dp[t.lca] - 2LL * dto[std::pair<int, int>(t.lca, par[t.lca][0])];
    else
      t.ans += dto[std::pair<int, int>(t.lca, par[t.lca][0])];
    printf("%lld\n", t.ans);
  }
  return 0;
}