#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<ld> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 42043;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };
Vi v[500005];
bool chk[500005];
int a[500005];
ll sub[500005];
int n,k;
Pi dfs(int N,int p=-1)
{
Pi res;
for(int next:v[N])
{
if(next==p)continue;
Pi P=dfs(next,N);
res.X+=P.X,res.Y+=P.Y;
}
if(res.Y==0 && chk[N])res.Y=1;
res.X+=res.Y/2;
res.Y&=1;
return res;
}
void dfs2(int N,int p=-1)
{
sub[N]|=1LL<<a[N];
for(int next:v[N])
{
if(next==p)continue;
dfs2(next,N);
sub[N]|=sub[next];
}
}
void dfs3(int N,ll now,int p=-1)
{
Vi t(k);
for(int next:v[N])
{
if(next==p)continue;
fup(i,0,k-1,1)if(sub[next]&(1LL<<i))t[i]++;
}
for(int next:v[N])
{
if(next==p)continue;
fup(i,0,k-1,1)if(sub[next]&(1LL<<i))t[i]--;
ll nx=now|(1LL<<a[N]);
fup(i,0,k-1,1)if(t[i])nx|=(1LL<<i);
if(!(nx&sub[next]))chk[N]=chk[next]=1;
dfs3(next,nx,N);
fup(i,0,k-1,1)if(sub[next]&(1LL<<i))t[i]++;
}
}
int main() {
scanf("%d%d",&n,&k);
fup(i,1,n-1,1)
{
int x,y;
scanf("%d%d",&x,&y);
v[x].pb(y);
v[y].pb(x);
}
fup(i,1,n,1)scanf("%d",a+i),a[i]--;
dfs2(1);
dfs3(1,0);
Pi p=dfs(1);
printf("%d\n",p.X+p.Y);
}
