#include<bits/stdc++.h>

 using namespace std;

 #define LL long long

 #define pii pair<int,int>

 #define inf 0x3f3f3f3f

 #define pb push_back

 #define mp make_pair

 const LL mod=1e9+;

 int s[];

 int main(){

    int v,k,i,j;

    while(cin>>v>>k){

        s[]=;

        s[v-]=;

        for(i=(v-)/,j=;j*+<=k;i--,j++){

            s[i]=;

            s[v--i]=;

         }

         if(v<k){

            for(i=v;i<k;++i) s[i]=;

            v=k;

         }

         LL ans=;

         for(i=;i<v;++i){

            ans=(ans*+s[i])%mod;

         }

         cout<<ans<<endl;

     }

    return ;

 }

 #include<bits/stdc++.h>

 using namespace std;

 #define LL long long

 #define pii pair<int,int>

 #define inf 0x3f3f3f3f

 #define pb push_back

 #define mp make_pair

 const LL mod=1e9+;

 const int maxn=;

 vector<int>g[maxn];

 LL A[maxn],n,ans=;

 int dfs(int u,int fa){

    int sum=,s=;

    for(int i=;i<g[u].size();++i){

        int v=g[u][i];

        if(v==fa) continue;

        int tmp=dfs(v,u);

        //s+=tmp;

        sum+=(tmp*(s+));

        s+=tmp;

        //if(u==1)cout<<"sum= "<<sum<<" "<<s<<endl;

        sum%=;

     }

     sum+=((LL)n-s-)*((LL)s+);

     sum%=;

     s++;

     if(sum)ans^=A[u];

     return s;

 }

 int main(){

    int i,j,u,v;

    scanf("%lld",&n);

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

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

        g[u].push_back(v);

        g[v].push_back(u);

     }

     for(i=;i<=n;++i)scanf("%lld",A+i);

     dfs(,);

     printf("%lld\n",ans);

    return ;

 }

 #include<bits/stdc++.h>

 using namespace std;

 int main(){

     int n;

     scanf("%d",&n);

     printf("%.7f\n",(2.0+n)/);

     return ;

 }