#include <cstdio>

#include <iostream>

#include <cstring>

#include <algorithm>

#include <set>

using namespace std;

const int maxn=10010;

int n,m,cnt,tot,rt,mn;

int to[maxn<<1],next[maxn<<1],val[maxn<<1],siz[maxn],head[maxn],q[110],ans[110],vis[maxn],p[maxn];

set<int> s;

inline int rd()

{

	int ret=0,f=1;	char gc=getchar();

	while(gc<'0'||gc>'9')	{if(gc=='-')f=-f;	gc=getchar();}

	while(gc>='0'&&gc<='9')	ret=ret*10+gc-'0',gc=getchar();

	return ret*f;

}

void add(int a,int b,int c)

{

	to[cnt]=b,val[cnt]=c,next[cnt]=head[a],head[a]=cnt++;

}

void getrt(int x,int fa)

{

	siz[x]=1;

	int i,tmp=0;

	for(i=head[x];i!=-1;i=next[i])	if(to[i]!=fa&&!vis[to[i]])

		getrt(to[i],x),siz[x]+=siz[to[i]],tmp=max(tmp,siz[to[i]]);

	tmp=max(tmp,tot-siz[x]);

	if(tmp<mn)	mn=tmp,rt=x;

}

void getdep(int x,int fa,int dep)

{

	int i;

	p[++p[0]]=dep,siz[x]=1;

	for(i=1;i<=m;i++)	ans[i]|=(s.find(q[i]-dep)!=s.end());

	for(i=head[x];i!=-1;i=next[i])	if(to[i]!=fa&&!vis[to[i]])	getdep(to[i],x,dep+val[i]),siz[x]+=siz[to[i]];

}

void dfs(int x)

{

	vis[x]=1;

	int i,j;

	s.clear(),s.insert(0);

	for(i=head[x];i!=-1;i=next[i])	if(!vis[to[i]])

	{

		p[0]=0,getdep(to[i],x,val[i]);

		for(j=1;j<=p[0];j++)	s.insert(p[j]);

	}

	for(i=head[x];i!=-1;i=next[i])	if(!vis[to[i]])	tot=siz[to[i]],mn=1<<30,getrt(to[i],x),dfs(rt);

}

int main()

{

	n=rd(),m=rd();

	int i,a,b,c;

	memset(head,-1,sizeof(head));

	for(i=1;i<n;i++)	a=rd(),b=rd(),c=rd(),add(a,b,c),add(b,a,c);

	for(i=1;i<=m;i++)	q[i]=rd();

	tot=n,mn=1<<30,getrt(1,0),dfs(rt);

	for(i=1;i<=m;i++)

	{

		if(!q[i]||ans[i])	printf("Yes\n");

		else	printf("No\n");

	}

	return 0;

}