#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define rep(i,a,b) for(int i = a; i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define PB push_back
#define FS first
#define SD second
#define ary(k) array<int,k>
template<class A, class B> void cmx(A& x, B y){ x = max<A>(x,y); }
template<class A, class B> void cmn(A& x, B y){ x = min<A>(x,y); }
typedef pair<int,int> pii;
typedef vector<int> vi;
template<class T> struct Point3D {
	typedef Point3D P;
	typedef const P& R;
	T x,y,z;
	explicit Point3D(T x=0, T y=0, T z=0) : x(x), y(y), z(z) {}
	bool operator<(R p) const {
		return tie(x,y,z) < tie(p.x,p.y,p.z); }
	
	P operator+(R p) const { return P(x+p.x,y+p.y,z+p.z); }
	P operator-(R p) const { return P(x-p.x,y-p.y,z-p.z); }
	P operator*(T d) const { return P(x*d,y*d,z*d); }
	P operator/(T d) const { return P(x/d,y/d,z/d); }
	T dist2() const { return x*x + y*y+z*z; }
	double dist() const { return sqrt((double)dist2()); }
	T dot(R p) const { return x*p.x + y*p.y + z*p.z; }
	P cross(R p) const {
		return P(y*p.z-z*p.y,z*p.x-x*p.z,x*p.y-y*p.x);
	}
	P rotate(double angle, P axis) const {
		double s = sin(angle), c = cos(angle); P u = axis.unit();
		return u*dot(u)*(1-c) + (*this)*c-cross(u)*s;
	}
	P unit() const { return *this / (T)dist(); }
	double phi() const {return atan2(y,x); }
	double theta() const {return atan2(sqrt(x*x+y*y),z); }

};
typedef double T;
const T EPS = 1e-9;
typedef Point3D<T> P;
bool eq(T x, T y){
	return fabs(x-y) < EPS;
}
bool lt(T x, T y){
	return x+EPS < y;
}
bool lt(P a, P b){
	if(lt(a.x,b.x)) return true;
	if(eq(a.x,b.x) && lt(a.y,b.y)) return true;
	if(eq(a.x,b.x) && eq(a.y,b.y) && lt(a.z,b.z)) return true;
	return false;
}
bool eq(P a, P b){
	return eq(a.x,b.x) && eq(a.y,b.y) && eq(a.z,b.z); 
}
signed main(){
	cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit);
	/*
	P tmp{1,1,0};
	tmp = tmp.rotate(-M_PI/4,P{0,0,1});
	cout << tmp.x << " " << tmp.y << " " << tmp.z << "\n";*/
	int n; cin >> n;
	vector<vi> adj(n),bdj(n);			
	vector<pii> ela,elb;
	vector<P> a,b;
	T sum_a = 0, sum_b = 0;
	rep(i,0,n){
		int x,y,z; cin >> x >> y >> z;
		a.PB(P{x,y,z});
	}
	rep(i,1,n){
		int u,v; cin >> u >> v;
		u--; v--;
		adj[u].PB(v); adj[v].PB(u);
		ela.PB({u,v});
		sum_a += (a[u]-a[v]).dist();
	}
	rep(i,0,n){
		int x,y,z; cin >> x >> y >> z;
		b.PB(P{x,y,z});
	}
	rep(i,1,n){
		int u,v; cin >> u >> v;
		u--; v--;
		u -= n; v -= n;
		bdj[u].PB(v); bdj[v].PB(u);
		elb.PB({u,v});
		sum_b += (b[u]-b[v]).dist();
	}
	// scale b to be a
	T scale = sum_a / sum_b;
	//cerr << "scale " << scale << "\n";
	rep(i,0,n) b[i] = b[i]*scale;	
	
	auto oa = a, ob = b;

	int ans = 0;
	// match leafs
	auto go = [&](int la, int lb){
		// move nodes to origin
		{
			P pla = a[la];
			rep(i,0,n) a[i] = a[i]-pla;
		}
		{
			P plb = b[lb];
			rep(i,0,n) b[i] = b[i]-plb;
		}
		// rotate so that x = 0, y = 0
		{
			P vec = a[adj[la][0]]-a[la];
			T angx = vec.phi();
			//cerr << "angx " << angx << "\n";
			vec = vec.rotate(-angx,P{0,0,1});
			T angy = vec.theta();
			vec = vec.rotate(-angy,P{0,1,0});
			//cerr << "angy " << angx << "\n";
			//cerr << vec.x << " " << vec.y << " " << vec.z << "\n";
			rep(i,0,n){
				a[i] = a[i].rotate(-angx,P{0,0,1});
				a[i] = a[i].rotate(-angy,P{0,1,0});
			}
		}
		{
			P vec = b[bdj[lb][0]]-b[lb];
			T angx = vec.phi();
			//cerr << "angx " << angx << "\n";
			vec = vec.rotate(-angx,P{0,0,1});
			T angy = vec.theta();
			vec = vec.rotate(-angy,P{0,1,0});
			//cerr << "angy " << angx << "\n";
			//cerr << vec.x << " " << vec.y << " " << vec.z << "\n";

			rep(i,0,n){
				b[i] = b[i].rotate(-angx,P{0,0,1});
				b[i] = b[i].rotate(-angy,P{0,1,0});
			}
		}
		
		// find non colinear in a
		vector<P> goods;
		rep(i,0,n)if(fabs(a[i].x) > EPS || fabs(a[i].y) > EPS) {
			goods.PB(a[i]);	
		}
		

		// check for current a and b
		auto chk_eq = [&](){
			/*
			cerr << "as\n";
			rep(i,0,n) cout << a[i].x << " " << a[i].y << " " << a[i].z << "\n";
			cerr << "bs\n";
			rep(i,0,n) cout << b[i].x << " " << b[i].y << " " << b[i].z << "\n";*/
			bool good = 1;	
			vector<pair<P,P>> sega,segb;
			for(auto[u,v]:ela){
				sega.PB({a[u],a[v]});
				if(lt(sega.back().SD,sega.back().FS)) swap(sega.back().FS,sega.back().SD);
			}
			for(auto[u,v]:elb){
				segb.PB({b[u],b[v]});
				if(lt(segb.back().SD,segb.back().FS)) swap(segb.back().FS,segb.back().SD);
			}
			sort(all(sega),[&](auto l, auto r){
				if(lt(l.FS,r.FS) || (eq(l.FS,r.FS) && lt(l.SD,r.SD))) return true;
				return false;
					});	
			sort(all(segb),[&](auto l, auto r){
				if(lt(l.FS,r.FS) || (eq(l.FS,r.FS) && lt(l.SD,r.SD))) return true;
				return false;
					});	
			rep(i,0,n-1){
				if(!eq(sega[i].FS,segb[i].FS) || !eq(sega[i].SD,segb[i].SD)){
					good = 0;
					break;
				}
			}
			return good;
		};
		if(!sz(goods)){
			ans += chk_eq();
			return;
		}
		auto chk_rot = [&](T thet){
			//cerr << "chk " << thet << "\n";
			auto olda = a, oldb = b;
			rep(i,0,n){
				a[i] = a[i].rotate(thet,P{0,0,1});
			}
			/*
			rep(i,0,n){
				b[i] = b[i].rotate(thet,P{0,0,1});
			}*/

			bool ret = chk_eq();
			a = olda; b = oldb;
			return ret;
		};
		// try matching p0
		P p0 = goods[0];		
		//cerr << "got " << p0.x << " " << p0.y << " " << p0.z << "\n";


		rep(i,0,n) if(eq(p0.z,b[i].z) && (fabs(b[i].x) > EPS || fabs(b[i].y) > EPS)){
			// a dot b = |a||b|cos theta		
			P u = p0,v = b[i];
			u.z = v.z = 0;
			T theta = v.phi() - u.phi();
			
			if(chk_rot(theta)) ans++;
		}
	};
	int leafa = -1;
	rep(i,0,n) if(sz(adj[i]) == 1){
		leafa = i;
		break;
	}
	rep(j,0,n) if(sz(bdj[j]) == 1){
		go(leafa,j);
		a = oa; b = ob;
	}
	cout << ans << "\n";
}