They say that Berland has exactly two problems, fools and roads. Besides, Berland has n cities, populated by the fools and connected by the roads. All Berland roads are bidirectional. As there are many fools in Berland, between each pair of cities there is a path (or else the fools would get upset). Also, between each pair of cities there is no more than one simple path (or else the fools would get lost). 

But that is not the end of Berland's special features. In this country fools sometimes visit each other and thus spoil the roads. The fools aren't very smart, so they always use only the simple paths.

A simple path is the path which goes through every Berland city not more than once.

The Berland government knows the paths which the fools use. Help the government count for each road, how many distinct fools can go on it.

Note how the fools' paths are given in the input.

Input

The first line contains a single integer n (2 ≤ n ≤ 105) — the number of cities. 

Each of the next n - 1 lines contains two space-separated integers ui, vi (1 ≤ ui, vi ≤ n, ui ≠ vi), that means that there is a road connecting cities ui and vi. 

The next line contains integer k (0 ≤ k ≤ 105) — the number of pairs of fools who visit each other. 

Next k lines contain two space-separated numbers. The i-th line (i > 0) contains numbers ai, bi (1 ≤ ai, bi ≤ n). That means that the fool number 2i - 1 lives in city ai and visits the fool number 2i, who lives in city bi. The given pairs describe simple paths, because between every pair of cities there is only one simple path.

Output

Print n - 1 integer. The integers should be separated by spaces. The i-th number should equal the number of fools who can go on the i-th road. The roads are numbered starting from one in the order, in which they occur in the input.

Examples

Input

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


Output

2 1 1 1 


Input

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


Output

3 1 1 1 

Note

In the first sample the fool number one goes on the first and third road and the fool number 3 goes on the second, first and fourth ones.

In the second sample, the fools number 1, 3 and 5 go on the first road, the fool number 5 will go on the second road, on the third road goes the fool number 3, and on the fourth one goes fool number 1.
import java.io.*;
import java.util.*;

import static java.lang.Math.*;
import static java.util.Arrays.*;

public class cf191c_2 {

    public static void main(String[] args) throws IOException {
        int n = ri(), node[] = new int[n - 1];
        Graph g = graph(n);
        Map<p, Integer> map = new HashMap<>();
        for (int i = 0; i < n - 1; ++i) {
            int u = rni() - 1, v = ni() - 1;
            g.c(u, v);
            map.put(new p(u, v), i);
        }
        dfs(g, 0, -1, map, node);
        hld hld = new hld(g, Long::sum, (a, b, l, r) -> a + b * (r - l + 1), 0);
        int k = ri();
        for (int i = 0; i < k; ++i) {
            int u = rni() - 1, v = ni() - 1;
            hld.upd(u, v, 1);
        }
        for (int i = 0; i < n - 1; ++i) {
            if (i != 0) {
                pr(' ');
            }
            pr(hld.qry(node[i]));
        }
        prln();
        close();
    }

    static void dfs(Graph g, int i, int p, Map<p, Integer> map, int[] node) {
        if (p != -1) {
            node[map.get(new p(p, i))] = i;
        }
        for (int j : g.get(i)) {
            if (j != p) {
                dfs(g, j, i, map, node);
            }
        }
    }

    static class p {
        int a, b;

        p(int a_, int b_) {
            a = a_;
            b = b_;
            if (a > b) {
                int __swap = a;
                a = b;
                b =__swap;
            }
        }

        @Override
        public String toString() {
            return "Pair{" + "a = " + a + ", b = " + b + '}';
        }

        public boolean asymmetricEquals(Object o) {
            p p = (p) o;
            return a == p.a && b == p.b;
        }

        public boolean symmetricEquals(Object o) {
            p p = (p) o;
            return a == p.a && b == p.b || a == p.b && b == p.a;
        }

        @Override
        public boolean equals(Object o) {
            return asymmetricEquals(o);
        }

        public int asymmetricHashCode() {
            return Objects.hash(a, b);
        }

        public int symmetricHashCode() {
            return Objects.hash(a, b) + Objects.hash(b, a);
        }

        @Override
        public int hashCode() {
            return asymmetricHashCode();
        }
    }

    static Graph graph(int n) {
        Graph g = new Graph();
        for (int i = 0; i < n; ++i) {
            g.add(new ArrayList<>());
        }
        return g;
    }

    static Graph graph(int n, int m) throws IOException {
        Graph g = graph(n);
        for (int i = 0; i < m; ++i) {
            g.c(rni() - 1, ni() - 1);
        }
        return g;
    }

    static Graph digraph(int n, int m) throws IOException {
        Graph g = graph(n);
        for (int i = 0; i < m; ++i) {
            g.cto(rni() - 1, ni()-  1);
        }
        return g;
    }

    static Graph tree(int n) throws IOException {
        return graph(n, n - 1);
    }

    static class Graph extends ArrayList<List<Integer>> {
        void cto(int u, int v) {
            get(u).add(v);
        }

        void c(int u, int v) {
            cto(u, v);
            cto(v, u);
        }
    }

    static class hld {
        static int p = 0;

        int n, par[], dep[], sz[], head[], pos[], heavy[];
        sgt sgt;

        hld(List<? extends Collection<Integer>> g, LongOperator op, LongRangeOperator range_op, long id) {
            this(g, 0, new long[g.size()], op, range_op, id);
        }

        hld(List<? extends Collection<Integer>> g, long[] a, LongOperator op, LongRangeOperator range_op, long id) {
            this(g, 0, a, op, range_op, id);
        }

        hld(List<? extends Collection<Integer>> g, int rt, LongOperator op, LongRangeOperator range_op, long id) {
            this(g, rt, new long[g.size()], op, range_op, id);
        }

        hld(List<? extends Collection<Integer>> g, int rt, long[] a, LongOperator op, LongRangeOperator range_op, long id) {
            n = g.size();
            par = new int[n];
            dep = new int[n];
            sz = new int[n];
            heavy = new int[n];
            head = new int[n];
            pos = new int[n];
            par[rt] = rt;
            fill(heavy, -1);
            dfs(g, rt, par, dep, sz, heavy);
            p = 0;
            decompose(g, rt, rt, par, heavy, head, pos);
            long[] na = new long[n];
            for (int i = 0; i < n; ++i) {
                na[pos[i]] = a[i];
            }
            sgt = new sgt(na, op, range_op, id);
        }

        void upd(int u, long x) {
            sgt.upd(pos[u], x);
        }

        void upd(int u, int v, long x) {
            for (; head[u] != head[v]; v = par[head[v]]) {
                if (dep[head[u]] > dep[head[v]]) {
                    int swap = u;
                    u = v;
                    v = swap;
                }
                sgt.upd(pos[head[v]], pos[v], x);
            }
            if (dep[u] > dep[v]) {
                int swap = u;
                u = v;
                v = swap;
            }
            sgt.upd(pos[u] + 1, pos[v], x);
        }

        long qry(int u) {
            return sgt.qry(pos[u]);
        }

        long qry(int u, int v) {
            long ans = sgt.id;
            for (; head[u] != head[v]; v = par[head[v]]) {
                if (dep[head[u]] > dep[head[v]]) {
                    int swap = u;
                    u = v;
                    v = swap;
                }
                ans = sgt.qry_op.merge(ans, sgt.qry(pos[head[v]], pos[v]));
            }
            if (dep[u] > dep[v]) {
                int swap = u;
                u = v;
                v = swap;
            }
            ans = sgt.qry_op.merge(ans, sgt.qry(pos[u], pos[v]));
            return ans;
        }

        static void decompose(List<? extends Collection<Integer>> g, int i, int h, int[] par, int[] heavy, int[] head, int[] pos) {
            head[i] = h;
            pos[i] = p++;
            if (heavy[i] != -1) {
                decompose(g, heavy[i], h, par, heavy, head, pos);
            }
            for (int j : g.get(i)) {
                if (j != par[i] && j != heavy[i]) {
                    decompose(g, j, j, par, heavy, head, pos);
                }
            }
        }

        static void dfs(List<? extends Collection<Integer>> g, int i, int[] par, int[] dep, int[] sz, int[] heavy) {
            sz[i] = 1;
            int max = 0;
            for (int j : g.get(i)) {
                if (j != par[i]) {
                    par[j] = i;
                    dep[j] = dep[i] + 1;
                    dfs(g, j, par, dep, sz, heavy);
                    sz[i] += sz[j];
                    if (sz[j] > max) {
                        max = sz[j];
                        heavy[i] = j;
                    }
                }
            }
        }
    }

    @FunctionalInterface
    interface LongOperator {
        long merge(long a, long b);
    }

    @FunctionalInterface
    interface LongRangeOperator {
        long merge(long a, long b, int l, int r);
    }

    static class sgt {
        LongOperator upd_op, qry_op;
        LongRangeOperator upd_range_op;
        int n;
        long sgt[], lazy[], id;

        sgt(int sz, LongOperator operator, long identity) {
            this(sz, operator, (x, y, l, r) -> x, operator, identity);
        }

        sgt(int sz, LongOperator operator, LongRangeOperator range_operator, long identity) {
            this(sz, operator, range_operator, operator, identity);
        }

        sgt(int sz, LongOperator update_operator, LongRangeOperator update_range_operator, LongOperator query_operator, long identity) {
            n = sz;
            sgt = new long[4 * n + 5];
            lazy = new long[4 * n + 5];
            upd_op = update_operator;
            upd_range_op = update_range_operator;
            qry_op = query_operator;
            id = identity;
            fill(sgt, id);
            fill(lazy, id);
        }

        sgt(long[] a, LongOperator operator, long identity) {
            this(a, operator, (x, y, l, r) -> x, operator, identity);
        }

        sgt(long[] a, LongOperator operator, LongRangeOperator range_operator, long identity) {
            this(a, operator, range_operator, operator, identity);
        }

        sgt(long[] a, LongOperator update_operator, LongRangeOperator update_range_operator, LongOperator query_operator, long identity) {
            this(a.length, update_operator, update_range_operator, query_operator, identity);
            build(1, a, 0, n - 1);
        }

        void set(int i, long x) {
            set(1, i, x, 0, n - 1);
        }

        void upd(int i, int j, long x) {
            upd(1, i, j, x, 0, n - 1);
        }

        void upd(int i, long x) {
            upd(1, i, x, 0, n - 1);
        }

        long qry(int l, int r) {
            return qry(1, l, r, 0, n - 1);
        }

        long qry(int i) {
            return qry(1, i, 0, n - 1);
        }

        void set(int node, int i, long x, int l, int r) {
            push(node, l, r);
            if (l == r) {
                sgt[node] = x;
            } else {
                int m = l + (r - l) / 2;
                if (i <= m) {
                    set(node << 1, i, x, l, m);
                } else {
                    set(node << 1 | 1, i, x, m + 1, r);
                }
                pull(node);
            }
        }

        void upd(int node, int i, long x, int l, int r) {
            push(node, l, r);
            if (l == r) {
                sgt[node] = upd_op.merge(sgt[node], x);
            } else {
                int m = l + (r - l) / 2;
                if (i <= m) {
                    upd(node << 1, i, x, l, m);
                } else {
                    upd(node << 1 | 1, i, x, m + 1, r);
                }
                pull(node);
            }
        }

        void upd(int node, int i, int j, long x, int l, int r) {
            push(node, l, r);
            if (r < i || j < l) {
                return;
            } else if (i <= l && r <= j) {
                lazy[node] = x;
                push(node, l, r);
            } else {
                int m = l + (r - l) / 2;
                upd(node << 1, i, j, x, l, m);
                upd(node << 1 | 1, i, j, x, m + 1, r);
                pull(node);
            }
        }

        long qry(int node, int i, int l, int r) {
            push(node, l, r);
            if (l == r) {
                return sgt[node];
            } else {
                int m = l + (r - l) / 2;
                if (i <= m) {
                    return qry(node << 1, i, l, m);
                } else {
                    return qry(node << 1 | 1, i, m + 1, r);
                }
            }
        }

        long qry(int node, int i, int j, int l, int r) {
            push(node, l, r);
            if (r < i || j < l) {
                return id;
            } else if (i <= l && r <= j) {
                return sgt[node];
            } else {
                int m = l + (r - l) / 2;
                return qry_op.merge(qry(node << 1, i, j, l, m), qry(node << 1 | 1, i, j, m + 1, r));
            }
        }

        void build(int node, long[] a, int l, int r) {
            if (l == r) {
                sgt[node] = a[l];
            } else {
                int m = l + (r - l) / 2;
                build(node << 1, a, l, m);
                build(node << 1 | 1, a, m + 1, r);
                pull(node);
            }
        }

        void pull(int node) {
            sgt[node] = qry_op.merge(sgt[node << 1], sgt[node << 1 | 1]);
        }

        void push(int node, int l, int r) {
            if (lazy[node] != id) {
                sgt[node] = upd_range_op.merge(sgt[node], lazy[node], l, r);
                if (l != r) {
                    lazy[node << 1] = upd_op.merge(lazy[node << 1], lazy[node]);
                    lazy[node << 1 | 1] = upd_op.merge(lazy[node << 1 | 1], lazy[node]);
                }
                lazy[node] = id;
            }
        }
    }

    static BufferedReader __i = new BufferedReader(new InputStreamReader(System.in));
    static PrintWriter __o = new PrintWriter(new OutputStreamWriter(System.out));
    static StringTokenizer input;
    static Random __r = new Random();

    // references
    // IBIG = 1e9 + 7
    // IMAX ~= 2e9
    // LMAX ~= 9e18

    // constants
    static final int IBIG = 1000000007;
    static final int IMAX = 2147483647;
    static final long LMAX = 9223372036854775807L;
    // math util
    static int minof(int a, int b, int c) {return min(a, min(b, c));}
    static int minof(int... x) {if (x.length == 1) return x[0]; if (x.length == 2) return min(x[0], x[1]); if (x.length == 3) return min(x[0], min(x[1], x[2])); int min = x[0]; for (int i = 1; i < x.length; ++i) if (x[i] < min) min = x[i]; return min;}
    static long minof(long a, long b, long c) {return min(a, min(b, c));}
    static long minof(long... x) {if (x.length == 1) return x[0]; if (x.length == 2) return min(x[0], x[1]); if (x.length == 3) return min(x[0], min(x[1], x[2])); long min = x[0]; for (int i = 1; i < x.length; ++i) if (x[i] < min) min = x[i]; return min;}
    static int maxof(int a, int b, int c) {return max(a, max(b, c));}
    static int maxof(int... x) {if (x.length == 1) return x[0]; if (x.length == 2) return max(x[0], x[1]); if (x.length == 3) return max(x[0], max(x[1], x[2])); int max = x[0]; for (int i = 1; i < x.length; ++i) if (x[i] > max) max = x[i]; return max;}
    static long maxof(long a, long b, long c) {return max(a, max(b, c));}
    static long maxof(long... x) {if (x.length == 1) return x[0]; if (x.length == 2) return max(x[0], x[1]); if (x.length == 3) return max(x[0], max(x[1], x[2])); long max = x[0]; for (int i = 1; i < x.length; ++i) if (x[i] > max) max = x[i]; return max;}
    static int powi(int a, int b) {if (a == 0) return 0; int ans = 1; while (b > 0) {if ((b & 1) > 0) ans *= a; a *= a; b >>= 1;} return ans;}
    static long powl(long a, int b) {if (a == 0) return 0; long ans = 1; while (b > 0) {if ((b & 1) > 0) ans *= a; a *= a; b >>= 1;} return ans;}
    static int fli(double d) {return (int) d;}
    static int cei(double d) {return (int) ceil(d);}
    static long fll(double d) {return (long) d;}
    static long cel(double d) {return (long) ceil(d);}
    static int gcd(int a, int b) {return b == 0 ? a : gcd(b, a % b);}
    static long gcd(long a, long b) {return b == 0 ? a : gcd(b, a % b);}
    static int[] exgcd(int a, int b) {if (b == 0) return new int[] {1, 0}; int[] y = exgcd(b, a % b); return new int[] {y[1], y[0] - y[1] * (a / b)};}
    static long[] exgcd(long a, long b) {if (b == 0) return new long[] {1, 0}; long[] y = exgcd(b, a % b); return new long[] {y[1], y[0] - y[1] * (a / b)};}
    static int randInt(int min, int max) {return __r.nextInt(max - min + 1) + min;}
    static long mix(long x) {x += 0x9e3779b97f4a7c15L; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9L; x = (x ^ (x >> 27)) * 0x94d049bb133111ebL; return x ^ (x >> 31);}
    // array util
    static void reverse(int[] a) {for (int i = 0, n = a.length, half = n / 2; i < half; ++i) {int swap = a[i]; a[i] = a[n - i - 1]; a[n - i - 1] = swap;}}
    static void reverse(long[] a) {for (int i = 0, n = a.length, half = n / 2; i < half; ++i) {long swap = a[i]; a[i] = a[n - i - 1]; a[n - i - 1] = swap;}}
    static void reverse(double[] a) {for (int i = 0, n = a.length, half = n / 2; i < half; ++i) {double swap = a[i]; a[i] = a[n - i - 1]; a[n - i - 1] = swap;}}
    static void reverse(char[] a) {for (int i = 0, n = a.length, half = n / 2; i < half; ++i) {char swap = a[i]; a[i] = a[n - i - 1]; a[n - i - 1] = swap;}}
    static void shuffle(int[] a) {int n = a.length - 1; for (int i = 0; i < n; ++i) {int ind = randInt(i, n); int swap = a[i]; a[i] = a[ind]; a[ind] = swap;}}
    static void shuffle(long[] a) {int n = a.length - 1; for (int i = 0; i < n; ++i) {int ind = randInt(i, n); long swap = a[i]; a[i] = a[ind]; a[ind] = swap;}}
    static void shuffle(double[] a) {int n = a.length - 1; for (int i = 0; i < n; ++i) {int ind = randInt(i, n); double swap = a[i]; a[i] = a[ind]; a[ind] = swap;}}
    static void rsort(int[] a) {shuffle(a); sort(a);}
    static void rsort(long[] a) {shuffle(a); sort(a);}
    static void rsort(double[] a) {shuffle(a); sort(a);}
    static int[] copy(int[] a) {int[] ans = new int[a.length]; for (int i = 0; i < a.length; ++i) ans[i] = a[i]; return ans;}
    static long[] copy(long[] a) {long[] ans = new long[a.length]; for (int i = 0; i < a.length; ++i) ans[i] = a[i]; return ans;}
    static double[] copy(double[] a) {double[] ans = new double[a.length]; for (int i = 0; i < a.length; ++i) ans[i] = a[i]; return ans;}
    static char[] copy(char[] a) {char[] ans = new char[a.length]; for (int i = 0; i < a.length; ++i) ans[i] = a[i]; return ans;}
    // input
    static void r() throws IOException {input = new StringTokenizer(rline());}
    static int ri() throws IOException {return Integer.parseInt(rline());}
    static long rl() throws IOException {return Long.parseLong(rline());}
    static double rd() throws IOException {return Double.parseDouble(rline());}
    static int[] ria(int n) throws IOException {int[] a = new int[n]; r(); for (int i = 0; i < n; ++i) a[i] = ni(); return a;}
    static int[] riam1(int n) throws IOException {int[] a = new int[n]; r(); for (int i = 0; i < n; ++i) a[i] = ni() - 1; return a;}
    static long[] rla(int n) throws IOException {long[] a = new long[n]; r(); for (int i = 0; i < n; ++i) a[i] = nl(); return a;}
    static double[] rda(int n) throws IOException {double[] a = new double[n]; r(); for (int i = 0; i < n; ++i) a[i] = nd(); return a;}
    static char[] rcha() throws IOException {return rline().toCharArray();}
    static String rline() throws IOException {return __i.readLine();}
    static String n() {return input.nextToken();}
    static int rni() throws IOException {r(); return ni();}
    static int ni() {return Integer.parseInt(n());}
    static long rnl() throws IOException {r(); return nl();}
    static long nl() {return Long.parseLong(n());}
    static double rnd() throws IOException {r(); return nd();}
    static double nd() {return Double.parseDouble(n());}
    // output
    static void pr(int i) {__o.print(i);}
    static void prln(int i) {__o.println(i);}
    static void pr(long l) {__o.print(l);}
    static void prln(long l) {__o.println(l);}
    static void pr(double d) {__o.print(d);}
    static void prln(double d) {__o.println(d);}
    static void pr(char c) {__o.print(c);}
    static void prln(char c) {__o.println(c);}
    static void pr(char[] s) {__o.print(new String(s));}
    static void prln(char[] s) {__o.println(new String(s));}
    static void pr(String s) {__o.print(s);}
    static void prln(String s) {__o.println(s);}
    static void pr(Object o) {__o.print(o);}
    static void prln(Object o) {__o.println(o);}
    static void prln() {__o.println();}
    static void pryes() {prln("yes");}
    static void pry() {prln("Yes");}
    static void prY() {prln("YES");}
    static void prno() {prln("no");}
    static void prn() {prln("No");}
    static void prN() {prln("NO");}
    static boolean pryesno(boolean b) {prln(b ? "yes" : "no"); return b;};
    static boolean pryn(boolean b) {prln(b ? "Yes" : "No"); return b;}
    static boolean prYN(boolean b) {prln(b ? "YES" : "NO"); return b;}
    static void prln(int... a) {for (int i = 0, len = a.length - 1; i < len; pr(a[i]), pr(' '), ++i); if (a.length > 0) prln(a[a.length - 1]); else prln();}
    static void prln(long... a) {for (int i = 0, len = a.length - 1; i < len; pr(a[i]), pr(' '), ++i); if (a.length > 0) prln(a[a.length - 1]); else prln();}
    static void prln(double... a) {for (int i = 0, len = a.length - 1; i < len; pr(a[i]), pr(' '), ++i); if (a.length > 0) prln(a[a.length - 1]); else prln();}
    static <T> void prln(Collection<T> c) {int n = c.size() - 1; Iterator<T> iter = c.iterator(); for (int i = 0; i < n; pr(iter.next()), pr(' '), ++i); if (n >= 0) prln(iter.next()); else prln();}
    static void h() {prln("hlfd"); flush();}
    static void flush() {__o.flush();}
    static void close() {__o.close();}
}