#include<bits/stdc++.h>
#define MAX 123466
#define ll long long
using namespace std;
struct Front_Link_Star{
int next,to;
}edge[MAX<<1];
ll Ma,Mi;
ll tree[MAX << 2],lazy[MAX << 2],ma[MAX<<2];int head[MAX<<1],top[MAX],son[MAX],depth[MAX];
int id[MAX],father[MAX],size[MAX],n,m,res,cnt,dfn;
inline void Add_Edge(int u,int v){
edge[++cnt].to=v;
edge[cnt].next=head[u];
head[u]=cnt;
}
inline void push_down(int now,int tl,int tr){
int mid=(tl+tr) >> 1;
lazy[now << 1]+=lazy[now];
lazy[now << 1|1]+=lazy[now];
tree[now << 1]+=lazy[now];
tree[now << 1|1]+=lazy[now];
ma[now<<1]+=lazy[now];
ma[now<<1|1]+=lazy[now];
lazy[now]=0;
} //线段树标记下传
inline void update(int now,int tl,int tr,int left,int right,ll change){
if (right<tl||tr<left)return;
if (left<=tl&&tr<=right){
tree[now]+=change;ma[now]+=change;
lazy[now]+=change;
return;
}
if (lazy[now]!=0)push_down(now,tl,tr);
int mid=(tl+tr) >> 1;
update(now << 1,tl,mid,left,right,change);
update(now << 1|1,mid+1,tr,left,right,change);
tree[now]=min(tree[now << 1],tree[now << 1|1]);
ma[now]=max(ma[now<<1],ma[now<<1|1]);
} //修改
inline void querymin(int now,int tl,int tr,int left,int right){
if (right<tl||tr<left)return;
if (left<=tl&&tr<=right){
Mi=min(Mi,tree[now]);
return;
}
if (lazy[now]!=0)push_down(now,tl,tr);
int mid=(tl+tr) >> 1;
querymin(now << 1,tl,mid,left,right);
querymin(now << 1|1,mid+1,tr,left,right);
} //查询
inline void querymax(int now,int tl,int tr,int left,int right){
if (right<tl||tr<left)return;
if (left<=tl&&tr<=right){
Ma=max(Ma,ma[now]);
return;
}
if (lazy[now]!=0)push_down(now,tl,tr);
int mid=(tl+tr) >> 1;
querymax(now << 1,tl,mid,left,right);
querymax(now << 1|1,mid+1,tr,left,right);
}
inline void Modify_Range(int x,int y,ll change){
while (top[x]!=top[y]){
if (depth[top[x]]<depth[top[y]])swap(x,y);
update(1,1,n,id[top[x]],id[x],change);
x=father[top[x]];
}
if (x==y)return; //两点重合了,就是轻边
if (depth[x]>depth[y])swap(x,y);
update(1,1,n,id[x],id[y],change);
//update要注意,因为我们换成了点权,所以要从id[x]+1
//开始
}
inline void Query_Range(int x,int y){
res=0;
while (top[x]!=top[y]){
if (depth[top[x]]<depth[top[y]])swap(x,y);
querymax(1,1,n,id[top[x]],id[x]), querymin(1,1,n,id[top[x]],id[x]);
x=father[top[x]];
}
if (x==y)return ;
if (depth[x]>depth[y])swap(x,y);
querymax(1,1,n,id[x],id[y]);querymin(1,1,n,id[x],id[y]);
return ;
} //同上
inline void DFS1(int now,int fa,int d){
father[now]=fa;
depth[now]=d;
size[now]=1;
int maxson=-1;
for (register int i=head[now];i;i=edge[i].next){
int v=edge[i].to;
if (v==fa)continue;
DFS1(v,now,d+1);
size[now]+=size[v];
if (size[v]>maxson){
maxson=size[v];
son[now]=v;
}
}
}
inline void DFS2(int now,int top_heavy){
top[now]=top_heavy;
id[now]=++dfn;
if (!son[now])return;
DFS2(son[now],top_heavy);
for (register int i=head[now];i;i=edge[i].next){
int v=edge[i].to;
if (v!=father[now]&&v!=son[now])DFS2(v,v);
}
} //树剖
int main(){
scanf("%d",&n);
for (register int i=1;i<n;i++){
int x,y;
scanf("%d%d",&x,&y);
Add_Edge(x,y);
Add_Edge(y,x);
}
scanf("%d",&m);
DFS1(1,1,1);
//其实这里DFS1(1,0,1)也是等价的,但从道理来说应该是DFS1(1,1,1)
DFS2(1,1);
while (m--){
Ma=-1e18,Mi=1e18;
int x,y;ll z;
int op;
scanf("%d",&op);
if(op==0) scanf("%d%d%lld",&x,&y,&z),Modify_Range(x,y,z);
else
{
scanf("%d%d",&x,&y),Query_Range(x,y);
if(Ma==Mi&&Mi==0)printf("Normal\n");
else printf("Lunatic\n");
}
}
return 0;
}