点分治 模板

//#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define sz(a) (int)a.size()
#define INF 0x3f3f3f3f
#define DNF 0x7f7f7f7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define PiL pair <ll , ll>
#define PLL pair <ll , ll>
#define Pii pair <int , int>
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define LF putchar('\n')
#define SP putchar(' ')
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)

template<typename T>
void read(T &x) {x = 0;char ch = getchar();ll f = 1;while(!isdigit(ch)){if(ch == '-')f *= -1;ch = getchar();}while(isdigit(ch)){x = x * 10 + ch - 48; ch = getchar();}x *= f;}
template<typename T, typename... Args>
void read(T &first, Args& ... args) {read(first);read(args...);}
template<typename T>
void write(T arg) {T x = arg;if(x < 0) {putchar('-'); x =- x;}if(x > 9) {write(x / 10);}putchar(x % 10 + '0');}
template<typename T, typename ... Ts>
void write(T arg, Ts ... args) {write(arg);if(sizeof...(args) != 0) {putchar(' ');write(args ...);}}

using namespace std;

const int N = 1e5 + 5;
int head[N] , cnt;
struct node1 {
    int t , w, next;
}edge[N * 4];
void add (int u , int v , int w)
{
    edge[cnt].t = v;
    edge[cnt].w = w;
    edge[cnt].next = head[u];
    head[u] = cnt ++;
}
int n , m, K[N];
int siz[N] , rt , tot;
int vis[N], t[10000007] , dis[N], ans[N];
//子树找根
void dfs_rt (int u , int fa, int S)
{
    siz[u] = 1;
    int RtCnt = 0;
    for (int i = head[u] ; i != -1 ; i = edge[i].next)
    {
        int v = edge[i].t;
        if (v != fa && !vis[v])
        {
            dfs_rt (v , u , S);
            siz[u] += siz[v];
            RtCnt = max(RtCnt , siz[v]);
        }
    }
    RtCnt = max(RtCnt , S - siz[u]);
    if (2ll * RtCnt <= S) rt = u;
}
//经过重心是否存在合法解
void dfs1(int u , int fa)
{
    ++ tot;
    for(int i = 1 ; i <= m ; i ++)
        if(dis[u] <= K[i])
            ans[i] |= t[K[i] - dis[u]];
    for(int i = head[u] ; i != -1 ; i = edge[i].next)
    {
        int v = edge[i].t , w = edge[i].w;
        if(v == fa || vis[v]) continue;
        dis[v] = dis[u] + w;
        dfs1(v,u);
    }
}
//子树路径加入维护的数据结构
void dfs2(int u , int fa, int flag)
{
    for(int i = 1 ; i <= m ; i ++)
    {
        if(dis[u] <= K[i]) {
            if (flag == 1) t[dis[u]] = 1;
            else t[dis[u]] = 0;
        }
    }
    for(int i = head[u] ; i != -1 ; i = edge[i].next)
    {
        int v = edge[i].t;
        if(v == fa || vis[v]) continue;
        dfs2(v,u,flag);
    }
}
//处理以重心为根的所有子树
void solve (int u)
{
    for (int i = head[u] ; i != -1 ; i = edge[i].next)
    {
        int v = edge[i].t , w = edge[i].w;
        if (!vis[v])
        {
            dis[v] = w;
            tot = 0;
            dfs1 (v , u);
            siz[v] = tot;
            dfs2 (v , u, 1);
        }
    }
    dfs2 (u , 0, -1);
}
//点分治
void work (int u , int fa, int S)
{
    dfs_rt (u , fa, S);
    u = rt;
    dis[rt] = 0 ;
    vis[rt] = 1;
    t[0] = 1;
    solve (rt);
    for (int i = head[u] ; i != - 1; i = edge[i].next)
    {
        int v = edge[i].t;
        if (!vis[v])
            work(v, u , siz[v]);
    }
}
int main()
{
    mem(head,-1);
    read (n , m);
    for (int i = 1 ; i < n ; i ++)
    {
        int u , v , w;
        read (u , v , w);
        add (u ,v ,w);
        add (v ,u ,w);
    }
    for (int i = 1 ; i <= m ; i ++)
        read (K[i]);
    work(1, 1, n);
    for(int i = 1 ; i <= m ; i ++)
        if(ans[i])
            cout<<"AYE"<<endl;
        else
            cout<<"NAY"<<endl;
}