namespace AtCoder.ABC.D138
{
    using System;
    using System.Collections;
    using System.Collections.Generic;
    using System.Linq;
    using System.Text;
    using System.Numerics;
    using System.IO;

    using AtCoder.ABC.IO;

    public class D138
    {
        public void Solve(Parser parser, Printer printer)
        {
            //
            int n = parser.Integer();
            int q = parser.Integer();

            var values = new int[n];

            var nodes = new Node[n];

            foreach (var item in Enumerable.Range(0, n))
            {
                nodes[item] = new Node(item);
            }

            foreach (var ab in parser.Take(n - 1))
            {
                var a = ab.Integer() - 1;
                var b = ab.Integer() - 1;

                nodes[a].Links.Add(nodes[b]);
                nodes[b].Links.Add(nodes[a]);
            }

            SetParent(nodes[0], null);

            foreach (var query in parser.Take(q))
            {
                var pi = query.Integer() - 1;
                var xi = query.Integer();

                values[pi] += xi;
            }

            foreach (var node in Bfs(nodes[0], n))
            {
                var parent = node.Parent;
                if (parent != null)
                {
                    values[node.I] += values[parent.I];
                }
            }

            var sb = new StringBuilder();

            foreach (var item in values)
            {
                sb.Append($"{item} ");
            }
            printer.Write(sb.ToString());

            printer.WriteLine();
            printer.Flush();
        }

        /// Traverse all links and set parent node recursively.
        private void SetParent(Node node, Node parent)
        {
            foreach (var link in node.Links)
            {
                if (link == parent)
                {
                    continue;
                }

                link.Parent = node;

                SetParent(link, node);
            }
        }

        private IEnumerable<Node> Bfs(Node root, int n)
        {
            bool[] visited = new bool[n];
            Queue<Node> q = new Queue<Node>();
            q.Enqueue(root);

            while (q.Count != 0)
            {
                Node v = q.Dequeue();

                foreach (var child in v.GetChild())
                {
                    if (visited[child.I])
                    {
                        continue;
                    }
                    yield return child;
                    visited[child.I] = true;
                    q.Enqueue(child);
                }
            }
        }
        public class Node
        {
            public int I;
            public Node Parent;
            public List<Node> Links;

            public Node(int i)
            {
                I = i;
                Links = new List<Node>();
            }

            public IEnumerable<Node> GetChild()
            {
                foreach (var item in Links)
                {
                    if (item == Parent)
                    {
                        continue;
                    }
                    yield return item;
                }
            }
        }
    }

    static class Program
    {
        static void Main(string[] args)
        {
            var i = new Parser(Console.OpenStandardInput());
            var o = new Printer(Console.OpenStandardOutput());
            new D138().Solve(i, o);
        }
    }
}
namespace AtCoder.ABC.IO
{
    #region IO

    using System;
    using System.IO;
    using System.Text;
    using System.Linq;
    using System.Collections.Generic;
    using System.Globalization;

    public class Parser
    {
        public Parser(Stream stream)
        {
            str = stream;
        }

        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof;

        public bool IsEndOfStream
        {
            get { return isEof; }
        }

        public IEnumerable<Parser> Take(int n)
        {
            return Enumerable.Range(1, n).Select(_ => this);
        }

        private byte read()
        {
            if (isEof) return 0;
            if (ptr < len) return buf[ptr++];
            ptr = 0;
            if ((len = str.Read(buf, 0, 1024)) > 0) return buf[ptr++];
            isEof = true;
            return 0;
        }

        public char Char()
        {
            byte b;
            do b = read(); while ((b < 33 || 126 < b) && !isEof);
            return (char)b;
        }

        public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }

        public string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n'; b = (char)read())
                if (b == 0) break;
                else if (b != '\r') sb.Append(b);
            return sb.ToString();
        }

        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0;
            byte b;
            var ng = false;
            do b = read(); while (b != 0 && b != '-' && (b < '0' || '9' < b));
            if (b == 0) return long.MinValue;
            if (b == '-')
            {
                ng = true;
                b = read();
            }
            for (; ; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                ret = ret * 10 + b - '0';
            }
        }

        public int Integer()
        {
            return (isEof) ? int.MinValue : (int)Long();
        }

        public double Double()
        {
            var s = Scan();
            return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN;
        }

        static T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n)
        {
            return enumerate(n, Char);
        }

        public string[] Scan(int n)
        {
            return enumerate(n, Scan);
        }

        public double[] Double(int n)
        {
            return enumerate(n, Double);
        }

        public int[] Integer(int n)
        {
            return enumerate(n, Integer);
        }

        public long[] Long(int n)
        {
            return enumerate(n, Long);
        }
    }

    public class Printer : StreamWriter
    {
        public override IFormatProvider FormatProvider
        {
            get { return CultureInfo.InvariantCulture; }
        }

        public Printer(Stream stream)
            : base(stream, new UTF8Encoding(false, true))
        {
        }

        public Printer(Stream stream, Encoding encoding)
            : base(stream, encoding)
        {
        }

        public void Write<T>(string format, T[] source)
        {
            base.Write(format, source.OfType<object>().ToArray());
        }

        public void WriteLine<T>(string format, T[] source)
        {
            base.WriteLine(format, source.OfType<object>().ToArray());
        }
    }

    #endregion

}

Measured memory_bytes: 82564