Problem: Note that this is the second problem of the two similar problems. You can hack this problem if you solve it. But you can hack the previous problem only if you solve both problems.

You are given a tree with n nodes. In the beginning, 0 is written on all edges. In one operation, you can choose any 2 distinct leaves u, v and any integer number x and add x to values written on all edges on the simple path between u and v. Note that in previous subtask x was allowed to be any real, here it has to be integer.

For example, on the picture below you can see the result of applying two operations to the graph: adding 2 on the path from 7 to 6, and then adding -1 on the path from 4 to 5. 

<image>

You are given some configuration of nonnegative integer pairwise different even numbers, written on the edges. For a given configuration determine if it is possible to achieve it with these operations, and, if it is possible, output the sequence of operations that leads to the given configuration. Constraints on the operations are listed in the output format section.

Leave is a node of a tree of degree 1. Simple path is a path that doesn't contain any node twice.

Input

The first line contains a single integer n (2 ≤ n ≤ 1000) — the number of nodes in a tree.

Each of the next n-1 lines contains three integers u, v, val (1 ≤ u, v ≤ n, u ≠ v, 0 ≤ val ≤ 10 000), meaning that there is an edge between nodes u and v with val written on it. It is guaranteed that these edges form a tree. It is guaranteed that all val numbers are pairwise different and even. 

Output

If there aren't any sequences of operations which lead to the given configuration, output "NO".

If it exists, output "YES" in the first line. In the second line output m — number of operations you are going to apply (0 ≤ m ≤ 10^5). Note that you don't have to minimize the number of the operations!

In the next m lines output the operations in the following format:

u, v, x (1 ≤ u, v ≤ n, u not = v, x — integer, -10^9 ≤ x ≤ 10^9), where u, v — leaves, x — number we are adding. 

It is guaranteed that if there exists a sequence of operations producing given configuration, then there exists a sequence of operations producing given configuration, satisfying all the conditions above.

Examples

Input


5
1 2 2
2 3 4
3 4 10
3 5 18


Output


NO

Input


6
1 2 6
1 3 8
1 4 12
2 5 2
2 6 4


Output


YES
4
3 6 1
4 6 3
3 4 7
4 5 2

Note

The configuration from the first sample is drawn below, and it is impossible to achieve.

<image>

The sequence of operations from the second sample is illustrated below.

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void read(T &x) {
  x = 0;
  char c = getchar();
  int f = 1;
  while (!isdigit(c)) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (isdigit(c)) {
    x = x * 10 + c - '0';
    c = getchar();
  }
  x *= f;
}
template <class T>
inline void umin(T &x, T y) {
  x = x < y ? x : y;
}
template <class T>
inline void umax(T &x, T y) {
  x = x > y ? x : y;
}
inline unsigned int R() {
  static unsigned int seed = 416;
  return seed ^= seed >> 5, seed ^= seed << 17, seed ^= seed >> 13;
}
const int N = 233333;
int rt, n, val[N], fa[N];
vector<int> e[N];
map<int, int> Map[N];
struct node {
  int x, y, z;
} ans[N];
int len;
void dfs(int u, int Fa) {
  fa[u] = Fa;
  for (register int i = (0); i <= (((int)e[u].size()) - 1); i++)
    if (e[u][i] != Fa) dfs(e[u][i], u);
  val[u] = Map[u][Fa];
}
void find(int u, int fa, int &x) {
  if (((int)e[u].size()) == 1) {
    x = u;
  }
  for (register int i = (0); i <= (((int)e[u].size()) - 1); i++)
    if (e[u][i] != fa) find(e[u][i], u, x);
}
void dfs1(int u) {
  for (register int i = (0); i <= (((int)e[u].size()) - 1); i++)
    if (e[u][i] != fa[u]) dfs1(e[u][i]);
  if (((int)e[u].size()) == 1) {
    if (val[u]) {
      ans[++len] = (node){u, rt, -val[u]};
      int x = -val[u];
      for (int d = u; d != rt; d = fa[d]) val[d] += x;
    }
  } else {
    int le[4];
    int l = 0, x = u;
    for (register int i = (0); i <= (((int)e[x].size()) - 1); i++)
      if (e[x][i] != fa[x] && l < 2) {
        l++;
        find(e[x][i], x, le[l]);
      }
    ans[++len] = (node){rt, le[1], -val[x] / 2};
    ans[++len] = (node){rt, le[2], -val[x] / 2};
    ans[++len] = (node){le[1], le[2], val[x] / 2};
    int del = -val[x];
    for (int d = u; d != rt; d = fa[d]) val[d] += del;
  }
}
int main() {
  read(n);
  for (register int i = (1); i <= (n - 1); i++) {
    int u, v, w;
    read(u);
    read(v);
    read(w);
    e[u].push_back(v);
    e[v].push_back(u);
    Map[u][v] = Map[v][u] = w;
  }
  for (register int i = (1); i <= (n); i++)
    if (((int)e[i].size()) == 2) {
      puts("NO");
      return 0;
    }
  puts("YES");
  rt = 1;
  for (register int i = (1); i <= (n); i++)
    if (((int)e[i].size()) == 1) rt = i;
  dfs(rt, 0);
  dfs1(rt);
  for (register int i = (1); i <= (n); i++) assert(!val[i]);
  printf("%d\n", len);
  for (register int i = (1); i <= (len); i++)
    printf("%d %d %d\n", ans[i].x, ans[i].y, -ans[i].z);
  return 0;
}