#include<bits/stdc++.h>

using namespace std;

#define MAXN 10010

#define MAXQ 110

struct Edge

{

    int to,w,nxt;

} e[MAXN<<];

int i,n,q,tot,root,u,v,w,len;

int size[MAXN],head[MAXN],weight[MAXN],sum[MAXN],val[MAXN],a[MAXQ];

bool visited[MAXN],ans[MAXQ];

inline void addedge(int u,int v,int w)

{

    tot++;

    e[tot] = (Edge){v,w,head[u]};

    head[u] = tot;

}

inline void getroot(int u,int fa,int total)

{

    int i,v;

    size[u] = ;

    weight[u] = ;

    for (i = head[u]; i; i = e[i].nxt)

    {

        v = e[i].to;

        if (fa != v && !visited[v])

        {

            getroot(v,u,total);

            size[u] += size[v];

            weight[u] = max(weight[u],size[v]);

        }

    }

    weight[u] = max(weight[u],total - size[u]);

    if (weight[u] < weight[root]) root = u;

}

inline void dfs(int u,int fa)

{

    int i,v,w;

    val[++len] = sum[u];

    for (i = head[u]; i; i = e[i].nxt)

    {

        v = e[i].to;

        w = e[i].w;

        if (v != fa && !visited[v])

        {

            sum[v] = sum[u] + w;

            dfs(v,u);

        }

    }

}

inline void calc(int u)

{

    int i,j,k,v,w;

    set< int > s;

    s.clear();

    s.insert();

    for (i = head[u]; i; i = e[i].nxt)

    {

        v = e[i].to;

        w = e[i].w;

        if (!visited[v])

        {

            sum[v] = w;

            len = ;

            dfs(v,u);

            for (j = ; j <= len; j++)

            {

                for (k = ; k <= q; k++)

                {

                    if (s.find(a[k] - val[j]) != s.end())

                        ans[k] = true;

                }

            }

            for (j = ; j <= len; j++) s.insert(val[j]);

        }

    }

}

inline void work(int u)

{

    int i,v;

    visited[u] = true;

    calc(u);

    for (i = head[u]; i; i = e[i].nxt)

    {

        v = e[i].to;

        if (!visited[v])

        {

            root = ;

            getroot(v,,size[v]);

            work(root);

        }

    }

}

int main()

{

    scanf("%d%d",&n,&q);

    for (i = ; i < n; i++)

    {

        scanf("%d%d%d",&u,&v,&w);

        addedge(u,v,w);

        addedge(v,u,w);

    }

    for (i = ; i <= q; i++) scanf("%d",&a[i]);

    root = ;

    size[] = weight[] = n;

    getroot(,,n);

    work(root);

    for (i = ; i <= q; i++) printf((ans[i] || a[i] == ) ? "Yes\n" : "No\n");

    return ;

}