Problem: There are n cities in the country of Berland. Some of them are connected by bidirectional roads in such a way that there exists exactly one path, which visits each road no more than once, between every pair of cities. Each road has its own length. Cities are numbered from 1 to n.

The travelling time between some cities v and u is the total length of the roads on the shortest path from v to u. 

The two most important cities in Berland are cities 1 and n.

The Berland Ministry of Transport decided to build a single new road to decrease the traffic between the most important cities. However, lots of people are used to the current travelling time between the most important cities, so the new road shouldn't change it too much. 

The new road can only be built between such cities v and u that v ≠ u and v and u aren't already connected by some road.

They came up with m possible projects. Each project is just the length x of the new road.

Polycarp works as a head analyst at the Berland Ministry of Transport and it's his job to deal with all those m projects. For the i-th project he is required to choose some cities v and u to build the new road of length x_i between such that the travelling time between the most important cities is maximal possible. 

Unfortunately, Polycarp is not a programmer and no analyst in the world is capable to process all projects using only pen and paper. 

Thus, he asks you to help him to calculate the maximal possible travelling time between the most important cities for each project. Note that the choice of v and u can differ for different projects.

Input

The first line contains two integers n and m (3 ≤ n ≤ 3 ⋅ 10^5, 1 ≤ m ≤ 3 ⋅ 10^5) — the number of cities and the number of projects, respectively.

Each of the next n - 1 lines contains three integers v_i, u_i and w_i (1 ≤ v_i, u_i ≤ n, 1 ≤ w_i ≤ 10^9) — the description of the i-th road. It is guaranteed that there exists exactly one path, which visits each road no more than once, between every pair of cities.

Each of the next m lines contains a single integer x_j (1 ≤ x_j ≤ 10^9) — the length of the road for the j-th project.

Output

Print m lines, the j-th line should contain a single integer — the maximal possible travelling time between the most important cities for the j-th project.

Example

Input

7 2
1 2 18
2 3 22
3 4 24
4 7 24
2 6 4
3 5 12
1
100


Output

83
88

Note

The road network from the first example:

<image>

You can build the road with length 1 between cities 5 and 6 to get 83 as the travelling time between 1 and 7 (1 → 2 → 6 → 5 → 3 → 4 → 7 = 18 + 4 + 1 + 12 + 24 + 24 = 83). Other possible pairs of cities will give answers less or equal to 83.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
vector<pair<long long int, long long int> > v1[300001];
long long int n, m, a[300001], weight[300001], branch[300001], b[300001],
    index1, index2, flag, val, val1 = LLONG_MAX;
void dfs(long long int node, long long int par) {
  long long int i;
  if (a[index1 - 1] == n) return;
  for (i = 0; i < v1[node].size(); i++) {
    if (a[index1 - 1] == n) return;
    if (v1[node][i].first != par) {
      a[index1] = v1[node][i].first;
      weight[index1] = v1[node][i].second;
      index1++;
      val += v1[node][i].second;
      dfs(v1[node][i].first, node);
      if (a[index1 - 1] != n) {
        index1--;
        val -= v1[node][i].second;
      }
    }
  }
}
void dfs1(long long int node, long long int par) {
  long long int i, j;
  for (i = 0; i < v1[node].size(); i++) {
    if (v1[node][i].first != par) {
      b[index2++] = v1[node][i].first;
      if (index2 >= 2) {
        if (b[index2 - 1] != a[index2 - 1] && b[index2 - 2] != a[index2 - 2]) {
          flag = 0;
        }
      }
      dfs1(v1[node][i].first, node);
      index2--;
    }
  }
}
void dfs2(long long int node, long long int par) {
  long long int i, j = 0;
  for (i = 0; i < v1[node].size(); i++) {
    if (v1[node][i].first != par) {
      dfs2(v1[node][i].first, node);
    }
  }
  if (v1[node].size() == 1 && node != 1) b[node] = 0;
  if ((v1[node].size() == 3) || (node == 1 && v1[node].size() == 2)) {
    for (i = 0; i < v1[node].size(); i++) {
      if (v1[v1[node][i].first].size() == 1 && v1[node][i].first != 1 &&
          v1[node][i].first != n)
        j = -v1[node][i].second;
    }
  }
  branch[node] = j;
  for (i = 0; i < v1[node].size(); i++) {
    if (v1[node][i].first != par) {
      if (v1[v1[node][i].first].size() >= 2 || v1[node][i].first == n)
        b[node] =
            min(b[node], min(0LL, b[v1[node][i].first]) + v1[node][i].second);
      else
        b[node] =
            min(b[node], min(0LL, b[v1[node][i].first]) - v1[node][i].second);
    }
  }
}
int main() {
  long long int u, v, w, x, flag1, val2, val3, val4, i, j;
  scanf("%lld %lld", &n, &m);
  for (i = 0; i < n - 1; i++) {
    scanf("%lld %lld %lld", &u, &v, &w);
    v1[u].push_back({v, w});
    v1[v].push_back({u, w});
  }
  a[0] = 1;
  weight[0] = 0;
  index1 = 1;
  val = 0;
  dfs(1, -1);
  a[index1] = 0;
  b[0] = 1;
  index2 = 1;
  flag = 1;
  for (i = 2; i <= n - 1; i++) {
    if (v1[i].size() >= 4) {
      flag = 0;
      break;
    }
  }
  if (v1[1].size() >= 3 || v1[n].size() >= 3) flag = 0;
  if (flag == 1) dfs1(1, -1);
  if (flag == 1) {
    for (i = 1; i < index1 - 1; i++)
      val1 = min(val1, weight[i] + weight[i + 1]);
    for (i = 0; i < 300001; i++) b[i] = LLONG_MAX;
    val2 = 0;
    dfs2(1, -1);
    for (i = 0; i < index1 - 1; i++) {
      if (branch[a[i]] != 0) {
        val1 = min(val1, branch[a[i]] + weight[i + 1] + min(0LL, b[a[i + 1]]));
      }
      if (b[a[i + 1]] != 0 && branch[a[i]] == 0) {
        val1 = min(val1, branch[a[i]] + weight[i + 1] + b[a[i + 1]]);
      }
    }
  } else
    val1 = 0;
  for (i = 1; i <= m; i++) {
    scanf("%lld", &x);
    printf("%lld\n", val - max(0LL, val1 - x));
  }
  return 0;
}