#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> adj[5000];
int p[5000] = {0}, d[5000] = {0};
int f[5000][5000] = {{0}};
vector<pair<int, int>> e;
vector<tuple<int, int, int>> ask;
bool v[5000] = {false};
pair<int, int> a;
void fk(int x, int g) {
  int y = p[x];
  if (x > y) swap(x, y);
  if (f[x][y])
    f[x][y] = max(f[x][y], g);
  else
    f[x][y] = g;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 0; i < n - 1; i++) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    adj[a].push_back(b);
    adj[b].push_back(a);
    if (a > b) swap(a, b);
    e.push_back({a, b});
  }
  stack<int> stk;
  v[0] = true;
  stk.push(0);
  while (stk.size()) {
    int c = stk.top();
    stk.pop();
    for (int ch : adj[c]) {
      if (v[ch]) continue;
      v[ch] = true;
      p[ch] = c;
      d[ch] = d[c] + 1;
      stk.push(ch);
    }
  }
  cin >> m;
  while (m--) {
    int a, b, g;
    cin >> a >> b >> g;
    a--, b--;
    ask.push_back({a, b, g});
    if (d[a] < d[b]) swap(a, b);
    while (d[a] > d[b]) {
      fk(a, g);
      a = p[a];
    }
    while (a != b) {
      fk(a, g);
      fk(b, g);
      a = p[a];
      b = p[b];
    }
  }
  pair<int, int> y;
  for (tuple<int, int, int> abg : ask) {
    int a, b, g;
    tie(a, b, g) = abg;
    if (d[a] < d[b]) swap(a, b);
    while (d[a] > d[b]) {
      y.first = a, y.second = p[a];
      if (a > p[a]) swap(y.first, y.second);
      if (f[y.first][y.second] == g) goto nxt;
      ;
      a = p[a];
    }
    while (a != b) {
      y.first = a, y.second = p[a];
      if (a > p[a]) swap(y.first, y.second);
      if (f[y.first][y.second] == g) goto nxt;
      ;
      y.first = b, y.second = p[b];
      if (b > p[b]) swap(y.first, y.second);
      if (f[y.first][y.second] == g) goto nxt;
      ;
      a = p[a];
      b = p[b];
    }
    cout << "-1\n";
    return 0;
  nxt:;
  }
  for (pair<int, int> ed : e) {
    if (f[ed.first][ed.second])
      cout << f[ed.first][ed.second];
    else
      cout << 1;
    if (ed == *--e.end())
      cout << '\n';
    else
      cout << ' ';
  }
}

### Prompt

In Cpp, your task is to solve the following problem:

There are n railway stations in Berland. They are connected to each other by n-1 railway sections. The railway network is connected, i.e. can be represented as an undirected tree.

You have a map of that network, so for each railway section you know which stations it connects.

Each of the n-1 sections has some integer value of the scenery beauty. However, these values are not marked on the map and you don't know them. All these values are from 1 to 10^6 inclusive.

You asked m passengers some questions: the j-th one told you three values:

  * his departure station a_j; 
  * his arrival station b_j; 
  * minimum scenery beauty along the path from a_j to b_j (the train is moving along the shortest path from a_j to b_j). 



You are planning to update the map and set some value f_i on each railway section — the scenery beauty. The passengers' answers should be consistent with these values.

Print any valid set of values f_1, f_2, ..., f_{n-1}, which the passengers' answer is consistent with or report that it doesn't exist.

Input

The first line contains a single integer n (2 ≤ n ≤ 5000) — the number of railway stations in Berland.

The next n-1 lines contain descriptions of the railway sections: the i-th section description is two integers x_i and y_i (1 ≤ x_i, y_i ≤ n, x_i ≠ y_i), where x_i and y_i are the indices of the stations which are connected by the i-th railway section. All the railway sections are bidirected. Each station can be reached from any other station by the railway.

The next line contains a single integer m (1 ≤ m ≤ 5000) — the number of passengers which were asked questions. Then m lines follow, the j-th line contains three integers a_j, b_j and g_j (1 ≤ a_j, b_j ≤ n; a_j ≠ b_j; 1 ≤ g_j ≤ 10^6) — the departure station, the arrival station and the minimum scenery beauty along his path.

Output

If there is no answer then print a single integer -1.

Otherwise, print n-1 integers f_1, f_2, ..., f_{n-1} (1 ≤ f_i ≤ 10^6), where f_i is some valid scenery beauty along the i-th railway section.

If there are multiple answers, you can print any of them.

Examples

Input


4
1 2
3 2
3 4
2
1 2 5
1 3 3


Output


5 3 5


Input


6
1 2
1 6
3 1
1 5
4 1
4
6 1 3
3 4 1
6 5 2
1 2 5


Output


5 3 1 2 1 


Input


6
1 2
1 6
3 1
1 5
4 1
4
6 1 1
3 4 3
6 5 3
1 2 4


Output


-1

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> adj[5000];
int p[5000] = {0}, d[5000] = {0};
int f[5000][5000] = {{0}};
vector<pair<int, int>> e;
vector<tuple<int, int, int>> ask;
bool v[5000] = {false};
pair<int, int> a;
void fk(int x, int g) {
  int y = p[x];
  if (x > y) swap(x, y);
  if (f[x][y])
    f[x][y] = max(f[x][y], g);
  else
    f[x][y] = g;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 0; i < n - 1; i++) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    adj[a].push_back(b);
    adj[b].push_back(a);
    if (a > b) swap(a, b);
    e.push_back({a, b});
  }
  stack<int> stk;
  v[0] = true;
  stk.push(0);
  while (stk.size()) {
    int c = stk.top();
    stk.pop();
    for (int ch : adj[c]) {
      if (v[ch]) continue;
      v[ch] = true;
      p[ch] = c;
      d[ch] = d[c] + 1;
      stk.push(ch);
    }
  }
  cin >> m;
  while (m--) {
    int a, b, g;
    cin >> a >> b >> g;
    a--, b--;
    ask.push_back({a, b, g});
    if (d[a] < d[b]) swap(a, b);
    while (d[a] > d[b]) {
      fk(a, g);
      a = p[a];
    }
    while (a != b) {
      fk(a, g);
      fk(b, g);
      a = p[a];
      b = p[b];
    }
  }
  pair<int, int> y;
  for (tuple<int, int, int> abg : ask) {
    int a, b, g;
    tie(a, b, g) = abg;
    if (d[a] < d[b]) swap(a, b);
    while (d[a] > d[b]) {
      y.first = a, y.second = p[a];
      if (a > p[a]) swap(y.first, y.second);
      if (f[y.first][y.second] == g) goto nxt;
      ;
      a = p[a];
    }
    while (a != b) {
      y.first = a, y.second = p[a];
      if (a > p[a]) swap(y.first, y.second);
      if (f[y.first][y.second] == g) goto nxt;
      ;
      y.first = b, y.second = p[b];
      if (b > p[b]) swap(y.first, y.second);
      if (f[y.first][y.second] == g) goto nxt;
      ;
      a = p[a];
      b = p[b];
    }
    cout << "-1\n";
    return 0;
  nxt:;
  }
  for (pair<int, int> ed : e) {
    if (f[ed.first][ed.second])
      cout << f[ed.first][ed.second];
    else
      cout << 1;
    if (ed == *--e.end())
      cout << '\n';
    else
      cout << ' ';
  }
}

```