#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll N=2e5+5,M=500,inf=1e18;
int n,m,rt,K,a[N],pos[N],L[M],R[M],op[N],X[N],Y[N],bl,br;
int par[N],dep[N],son[N],seg[N],rev[N],top[N],siz[N],tot1,now=1,vis[N];
ll dis[N],minn,ans[N];
struct edge{int to,w;};
vector<edge>v[N];vector<int>b1,b2;
void dfs(int x,int fa){
	dep[x]=dep[fa]+1,siz[x]=1,par[x]=fa;
	for(int i=0;i<v[x].size();i++)
		if(v[x][i].to!=fa){
			dis[v[x][i].to]=dis[x]+v[x][i].w;
			dfs(v[x][i].to,x);
            siz[x]+=siz[v[x][i].to];
            if(siz[v[x][i].to]>siz[son[x]])
                son[x]=v[x][i].to;
		}
}
void dfs2(int x,int topf){
	seg[x]=++tot1;
	rev[tot1]=x;
	top[x]=topf;
	if(!son[x]) return ;
	dfs2(son[x],topf);
	for(int i=0;i<v[x].size();i++)
		if(!top[v[x][i].to])
			dfs2(v[x][i].to,v[x][i].to);
}
int get(int x,int y){
    y=max(1,dep[x]-y);
	while(dep[top[x]]>y) x=par[top[x]];
	return rev[seg[x]-(dep[x]-y)];
}
struct _FJqwq{
	int val[N],tag,sum;
	void change1(int x,int d){val[x]=d-tag;}
	void change2(int x,int d){val[x]+=d;}
	void change3(int d){tag+=d;}
	int query(int x){return val[x]+tag;}
}zhx;
void change(){
    for(int i=0,x;i<b1.size();i++){
        x=b1[i];
        a[x]=par[a[x]];
        minn=min(minn,dis[a[x]]);
        zhx.change2(x,-1);
        if(vis[a[x]]!=now){
            vis[a[x]]=now;
            b2.push_back(x);
        }
    }
    b1.clear();
	b1=b2;
	b2.clear();
}
void pushdown(){
    for(int i=bl,x;i<=br;i++){
        x=zhx.query(i);
        a[i]=get(a[i],x);
        zhx.change1(i,0);
    }
}
void pre(){
    b1.clear();
    for(int j=bl;j<=br;j++){
        minn=min(minn,dis[a[j]]);
        if((a[j]!=rt)&&(vis[par[a[j]]]!=now))
			b1.push_back(j);
        zhx.change1(j,0);
    }
}
int main(){
//	freopen("circle.in","r",stdin);
//	freopen("circle.out","w",stdout);
	scanf("%d%d%d",&n,&m,&rt),K=sqrt(n);
	for(int i=1,x,y,z;i<n;i++){
		scanf("%d%d%d",&x,&y,&z);
		v[x].push_back(edge{y,z});
		v[y].push_back(edge{x,z});
	}
    dfs(rt,0);
    dfs2(rt,rt);
    par[rt]=rt;
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	for(int i=1;i<=n;i++) pos[i]=(i-1)/K+1;
	for(int i=1;i<=n;i++) R[pos[i]]=i;
	for(int i=n;i;i--) L[pos[i]]=i;
	for(int i=1;i<=m;i++) scanf("%d%d%d",&op[i],&X[i],&Y[i]);
    for(int i=1;i<=m;i++) ans[i]=inf;
    for(int i=1;i<=pos[n];i++){
        minn=inf;bl=L[i],br=R[i];
        now++;pre();
        for(int j=1;j<=m;j++){
            if(Y[j]<bl) continue;
            if(br<X[j]) continue;
            if(op[j]==1){
                if(X[j]<=bl&&br<=Y[j]){
                    /*sigma = N*/
                     zhx.change3(1);
                     change();
                }
                else{
                    /*O(sqrt N)*/
                     pushdown();
                     for(int p=max(X[j],bl);p<=min(br,Y[j]);p++){
                         a[p]=par[a[p]];
                         minn=min(minn,dis[a[p]]);
                     }
                     pre();
                }
            }
            else{
                if(X[j]<=bl&&br<=Y[j]) /*O(1)*/ ans[j]=min(ans[j],minn);
                else{
                    /*O(sqrt N)*/
                    for(int p=max(X[j],bl),x;p<=min(br,Y[j]);p++){
				        x=zhx.query(p);
				        a[p]=get(a[p],x);
				        zhx.change1(p,0);
						ans[j]=min(ans[j],dis[a[p]]);
					}
                }
			}
        }
    }
    for(int i=1;i<=m;i++)
        if(op[i]==2)
            printf("%lld\n",ans[i]);
    return 0;
}


/*
10 17 1
1 2 154
1 3 60
3 4 156
1 5 58
5 6 112
4 7 143
7 8 57
7 9 189
7 10 197
10 10 9 4 5 1 9 2 10 3 
2 5 7
2 6 9
2 6 10
2 2 3
1 8 10
2 2 8
1 6 7
2 1 2
1 8 10
2 9 10
1 1 9
1 8 10
2 7 10
2 1 9
1 5 7
1 3 9
2 6 8

*/