#include<iostream>

#include<cstdio>

#include<cstring>

#include<cmath>

using namespace std;

typedef unsigned long long ull;

int n,x,y;

int num[];

ull t;

struct G{int y,nxt;}g[];int h[],tot=;

int dfs(int x,int fa)

{

    int c=num[x],d=;

    for (int i=h[x];i;i=g[i].nxt)

        if (g[i].y!=fa) d^=dfs(g[i].y,x);

    return c-=(c<=d);

}

int main()

{

    while (scanf("%d",&n)!=EOF)

    {

        for (int i=;i<=n;i++){scanf("%llu",&t);num[i]=(int)log2(t)+;}

        memset(h,,sizeof(h));tot=;

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

        {

            scanf("%d%d",&x,&y);x++;y++;

            g[++tot]=G{y,h[x]};h[x]=tot;

            g[++tot]=G{x,h[y]};h[y]=tot;

        }

        dfs(,)?printf("Alice\n"):printf("Marisa\n");

    }

}