//Twenty
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<vector>
#include<cmath>
#include<queue>
#include<ctime>
const int maxn=100005;
typedef long long LL;
using namespace std;
int T,db[27],sza,szb;
char a[maxn],b[maxn];void read(char c[],int &sz) {char ch=getchar(); sz=0;while(ch=='\n'||ch=='\r') ch=getchar();while(ch!='\n'&&ch!='\r') {c[++sz]=ch;ch=getchar();}
}int check() {read(a,sza); read(b,szb);memset(db,-1,sizeof(db));if(sza!=szb) return 0;for(int i=1;i<=sza;i++) {if(a[i]>='a'&&a[i]<='z'&&b[i]>='a'&&b[i]<='z') {if(db[a[i]-'a']==-1) db[a[i]-'a']=b[i]-'a';else if(db[a[i]-'a']!=b[i]-'a') return 0; }else if(a[i]!=b[i]) return 0;}return 1;
}void init() {scanf("%d",&T);for(int i=1;i<=T;i++) printf("%d\n",check());
}#define DEBUG
int main()  {
#ifdef DEBUGfreopen("copycat.in","r",stdin);freopen("copycat.out","w",stdout);
#endifinit();return 0;
}

//Twenty
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<vector>
#include<cmath>
#include<queue>
#include<ctime>
#define INF 1e18
const int maxn=5e5+5;
const int maxm=1e6+5;
typedef long long LL;
using namespace std;
int n,m,l=0,r=10000,s,t,sz,fa[maxn];
LL ans1,ans2;namespace fastIO {const int sz=1<<15|1;char ch,buf[sz],*l,*r;void gechar(char &c) {if(l==r) r=(l=buf)+fread(buf,1,sz,stdin);c = l==r?(char)EOF:*l++;}template<typename T> void read(T &x) {int f=1; x=0; gechar(ch);while(ch!='-'&&(ch<'0'||ch>'9')) gechar(ch);if(ch=='-') f=-1,gechar(ch);for(;ch>='0'&&ch<='9';gechar(ch)) x=x*10+ch-'0'; x*=f;}
}struct edge {int u,v,t;LL val;edge(){}edge(int u,int v,int t,LL val):u(u),v(v),t(t),val(val){}friend bool operator <(const edge&A,const edge&B) {return A.t<B.t||(A.t==B.t&&A.val<B.val);}
}e[maxm];int ecnt,fir[maxn],nxt[maxm<<1],to[maxm<<1];
LL val[maxm<<1],dis[maxn];
void add(int u,int v,LL vv) {nxt[++ecnt]=fir[u]; fir[u]=ecnt; to[ecnt]=v; val[ecnt]=vv;nxt[++ecnt]=fir[v]; fir[v]=ecnt; to[ecnt]=u; val[ecnt]=vv;
}int que[maxn<<1],vis[maxn],ql,qr;
int spfa() {ql=maxn+1; qr=maxn;for(int i=1;i<=n;i++) dis[i]=INF,vis[i]=0;dis[s]=0;que[++qr]=s; vis[s]=1;while(ql<=qr) {int x=que[ql++];vis[x]=0;for(int i=fir[x];i;i=nxt[i]) {if(dis[to[i]]>dis[x]+val[i]) {dis[to[i]]=dis[x]+val[i];if(!vis[to[i]]) {vis[to[i]]=1;if(ql<=qr&&dis[to[i]]<=dis[que[ql]]) que[--ql]=to[i];else que[++qr]=to[i];}}}}
}int find(int x) {return x==fa[x]?x:fa[x]=find(fa[x]);
}void work() {for(int i=1;i<=n;i++) fa[i]=i;sort(e+1,e+sz+1);for(int i=1;i<=sz;i++) {int u=e[i].u,v=e[i].v;ans1=e[i].t;int x=find(u),y=find(v);add(u,v,e[i].val);if(x!=y) {fa[x]=y;}if(find(s)==find(t)) {for(int k=i+1;e[k].t==ans1;k++) add(e[k].u,e[k].v,e[k].val);break;}}spfa();ans2=dis[t];printf("%lld %lld\n",ans1,ans2);
}void init() {fastIO::read(n);fastIO::read(m);for(int i=1;i<=m;i++) {int u,v,t,c;fastIO::read(u);fastIO::read(v);fastIO::read(t);fastIO::read(c);e[++sz]=edge(u,v,t,(LL)t*c);}fastIO::read(s);fastIO::read(t);
}#define DEBUG
int main()  {
#ifdef DEBUGfreopen("running.in","r",stdin);freopen("running.out","w",stdout);
#endifinit();work();return 0;
}

//Twenty
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<vector>
#include<cmath>
#include<queue>
#include<ctime>
#define INF 1e18;
const int maxn=305;
typedef long long LL;
using namespace std;
int n,ti,wl[maxn],sj[maxn],str;
LL g[maxn][maxn][3],ans;namespace fastIO {const int sz=1<<15|1;char ch,buf[sz],*l,*r;void gechar(char &c) {if(l==r) r=(l=buf)+fread(buf,1,sz,stdin);c = l==r?(char)EOF:*l++;}template<typename T> void read(T &x) {int f=1; x=0; gechar(ch);while(ch!='-'&&(ch<'0'||ch>'9')) gechar(ch);if(ch=='-') f=-1,gechar(ch);for(;ch>='0'&&ch<='9';gechar(ch)) x=x*10+ch-'0'; x*=f;}
}int ecnt,fir[maxn],nxt[maxn<<1],to[maxn<<1],val[maxn<<1];
void add(int u,int v,int w) {nxt[++ecnt]=fir[u]; fir[u]=ecnt; to[ecnt]=v; val[ecnt]=w;nxt[++ecnt]=fir[v]; fir[v]=ecnt; to[ecnt]=u; val[ecnt]=w;
}void dfs(int x,int fa) {sj[x]=min(sj[x],ti+1);g[x][sj[x]][0]=g[x][sj[x]][1]=g[x][sj[x]][2]=wl[x];for(int i=0;i<sj[x];i++)g[x][i][0]=g[x][i][1]=g[x][i][2]=-INF;for(int i=fir[x];i;i=nxt[i]) if(to[i]!=fa) {int y=to[i];dfs(y,x);for(int j=ti;j>=val[i];j--) {for(int k=0;k+val[i]<=j;k++) {if(k+2*val[i]<=j) g[x][j][2]=max(g[x][j][2],g[x][j-(k+2*val[i])][2]+g[y][k][0]);if(k+2*val[i]<=j) g[x][j][2]=max(g[x][j][2],g[x][j-(k+2*val[i])][0]+g[y][k][2]);g[x][j][2]=max(g[x][j][2],g[x][j-(k+val[i])][1]+g[y][k][1]);  if(k+2*val[i]<=j) g[x][j][1]=max(g[x][j][1],g[x][j-(k+2*val[i])][1]+g[y][k][0]);g[x][j][1]=max(g[x][j][1],g[x][j-(k+val[i])][0]+g[y][k][1]);if(k+2*val[i]<=j) g[x][j][0]=max(g[x][j][0],g[x][j-(k+2*val[i])][0]+g[y][k][0]);             }                       }}for(int i=0;i<=ti;i++) for(int j=0;j<=2;j++) ans=max(g[x][i][j],ans);
}void work() {if(!str) {printf("0\n"); return;}dfs(str,0);printf("%lld\n",ans);
}void init() {fastIO::read(n);fastIO::read(ti);for(int i=1;i<=n;i++) {fastIO::read(wl[i]); if(!str&&wl[i]) str=i;}for(int i=1;i<=n;i++) fastIO::read(sj[i]);for(int i=1;i<n;i++) {int a,b,c;fastIO::read(a);fastIO::read(b);fastIO::read(c);add(a,b,c);}
}#define DEBUG
int main()  {
#ifdef DEBUGfreopen("toyuq.in","r",stdin);freopen("toyuq.out","w",stdout);
#endifinit();work();return 0;
}