import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }

//long mod = 10^^9 + 7;
long mod = 998_244_353;
//long mod = 1_000_003;
void moda(T)(ref T x, T y) { x = (x + y) % mod; }
void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(T)(ref T x, T y) { x = (x * y) % mod; }
void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(T)(ref T x, T y) { y.modpow(mod - 2); x.modm(y); }

void main()
{
	auto n = RD!int;
	auto a = new long[](n);
	auto b = new long[](n);
	auto c = new long[](n);
	foreach (i; 0..n)
	{
		a[i] = RD;
		b[i] = RD;
		c[i] = RD;
	}
	auto edges = new int[][](n);
	foreach (i; 0..n-1)
	{
		auto u = RD!int-1;
		auto v = RD!int-1;
		edges[u] ~= v;
		edges[v] ~= u;
	}

	auto d = new long[](n);
	auto cnt = new long[](n);
	auto par = new int[](n);
	
	long[] dfs(int pos, int last)
	{
		par[pos] = last;
		d[pos] = c[pos] - b[pos];
		cnt[pos] = b[pos] == c[pos] ? 0 : 1;
		foreach (to; edges[pos])
		{
			if (to == last) continue;
			auto r = dfs(to, pos);
			d[pos] += r[0];
			cnt[pos] += r[1];
		}
		return [d[pos], cnt[pos]];
	}
	dfs(0, -1);

	if (d[0] != 0)
		writeln(-1);
	else
	{
		long ans = a[0] * cnt[0];
		void dfs2(int pos, int last, long cost)
		{
			if (a[pos] < cost)
			{
				auto x = cnt[pos] - abs(d[pos]);
				ans -= cost * x;
				ans += a[pos] * x;
				cost = a[pos];
			}
			
			foreach (to; edges[pos])
			{
				if (to == last) continue;
				dfs2(to, pos, cost);
			}
		}
		dfs2(0, -1, a[0]);
		writeln(ans);
	}

	stdout.flush;
	debug readln;
}
