#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", 3)
namespace chtholly {
inline int read() {
  int x = 0, f = 1;
  char c = getchar();
  for (; !isdigit(c); c = getchar()) f ^= c == '-';
  for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ '0');
  return f ? x : -x;
}
template <typename mitsuha>
inline bool read(mitsuha &x) {
  x = 0;
  int f = 1;
  char c = getchar();
  for (; !isdigit(c) && ~c; c = getchar()) f ^= c == '-';
  if (!~c) return 0;
  for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ '0');
  return x = f ? x : -x, 1;
}
template <typename mitsuha>
inline int write(mitsuha x) {
  if (!x) return 0 & putchar(48);
  if (x < 0) x = -x, putchar('-');
  int bit[20], i, p = 0;
  for (; x; x /= 10) bit[++p] = x % 10;
  for (i = p; i; --i) putchar(bit[i] + 48);
  return 0;
}
inline char fuhao() {
  char c = getchar();
  for (; isspace(c); c = getchar())
    ;
  return c;
}
}  // namespace chtholly
using namespace chtholly;
using namespace std;
const int yuzu = 3e5;
struct edge {
  int to, cost;
};
vector<edge> lj[yuzu | 10];
typedef long long fuko[yuzu | 10];
fuko d[2], a;
map<pair<long long, int>, int> mp;
stack<int> lxy;
priority_queue<pair<long long, int> > q;
void gdp(int u, int fa, long long dep, int id) {
  d[id][u] = dep;
  for (edge i : lj[u]) {
    int v = i.to, c = i.cost;
    if (v ^ fa) gdp(v, u, dep + c, id);
  }
}
bool cmp(long long a, long long b) { return d[0][a] > d[0][b]; }
int main() {
  int i, n = read(), m = read();
  for (i = 1; i < n; ++i) {
    int u = read(), v = read(), c = read();
    lj[u].push_back(edge{v, c});
    lj[v].push_back(edge{u, c});
    mp[pair<long long, int>(u, v)] = mp[pair<long long, int>(v, u)] = 1;
  }
  long long sum = 0;
  gdp(1, 0, 0, 0), gdp(n, 0, 0, 1);
  for (i = 1; i <= n; ++i) a[i] = i;
  sort(a + 1, a + n + 1, cmp);
  for (i = 1; i <= n; ++i) {
    for (; !q.empty();) {
      pair<long long, int> now = q.top();
      long long x = now.first;
      int y = now.second;
      if (!mp.count(pair<long long, int>(y, a[i])) && y ^ a[i]) {
        sum = max(sum, d[0][a[i]] + x);
        break;
      }
      lxy.push(y), q.pop();
    }
    for (; !lxy.empty(); lxy.pop()) {
      q.push(pair<long long, int>(d[1][lxy.top()], lxy.top()));
    }
    q.push(pair<long long, int>(d[1][a[i]], a[i]));
  }
  for (; m--; write(min(sum + read(), d[0][n])), puts(""))
    ;
}
