3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
inline long long read() {
  long long x = 0;
  char c = getchar(), f = 1;
  for (; c < '0' || '9' < c; c = getchar())
    if (c == '-') f = -1;
  for (; '0' <= c && c <= '9'; c = getchar()) x = x * 10 + c - '0';
  return x * f;
}
inline void write(long long x) {
  static char buf[20];
  int len = 0;
  if (x < 0) putchar('-'), x = -x;
  for (; x; x /= 10) buf[len++] = x % 10 + '0';
  if (!len)
    putchar('0');
  else
    while (len) putchar(buf[--len]);
}
inline void writesp(long long x) {
  write(x);
  putchar(' ');
}
inline void writeln(long long x) {
  write(x);
  putchar('\n');
}
struct edge {
  int to, nxt, d;
} e[2 * 200010];
int fir[200010], mark[200010], dist[200010], from[200010], size[200010];
double f[200010];
int w[200010];
int n, tot;
void add_edge(int x, int y, int z) {
  e[tot].to = y;
  e[tot].d = z;
  e[tot].nxt = fir[x];
  fir[x] = tot++;
}
void dfs(int now, int fa) {
  for (int i = fir[now]; ~i; i = e[i].nxt)
    if (e[i].to != fa) {
      dist[e[i].to] = dist[now] + e[i].d;
      from[e[i].to] = from[now];
      dfs(e[i].to, now);
    }
}
void prepare(int now, int fa) {
  size[now] = 1;
  for (int i = fir[now]; ~i; i = e[i].nxt)
    if (e[i].to != fa && !mark[e[i].to]) {
      prepare(e[i].to, now);
      size[now] += size[e[i].to];
    }
}
int find_root(int now, int fa, int S) {
  int mx = 0;
  for (int i = fir[now]; ~i; i = e[i].nxt)
    if (e[i].to != fa && !mark[e[i].to]) {
      int tmp = find_root(e[i].to, now, S);
      if (tmp) return tmp;
      mx = std::max(mx, size[e[i].to]);
    }
  if (std::max(mx, S - size[now]) <= S / 2)
    return now;
  else
    return 0;
}
struct Data {
  double val;
  int id;
  friend bool operator<(Data a, Data b) { return a.val < b.val; }
};
Data solve(int now) {
  mark[now] = 1;
  dist[now] = 0;
  for (int i = fir[now]; ~i; i = e[i].nxt) {
    dist[e[i].to] = e[i].d;
    from[e[i].to] = e[i].to;
    f[e[i].to] = 0;
    dfs(e[i].to, now);
  }
  Data ret = (Data){0, now};
  for (int i = 1; i <= n; i++) {
    f[from[i]] += 1.5 * sqrt(dist[i]) * w[i];
    ret.val += dist[i] * sqrt(dist[i]) * w[i];
  }
  double sum = 0;
  for (int i = fir[now]; ~i; i = e[i].nxt) sum += f[e[i].to];
  Data mn = (Data){1e36, 0};
  for (int i = fir[now]; ~i; i = e[i].nxt) {
    Data tmp = (Data){sum - 2 * f[e[i].to], e[i].to};
    if (tmp < mn) mn = tmp;
  }
  if (!mark[mn.id]) {
    prepare(mn.id, now);
    Data tmp = solve(find_root(mn.id, now, size[mn.id]));
    if (tmp < ret) ret = tmp;
  }
  return ret;
}
int main() {
  n = read();
  for (int i = 1; i <= n; i++) w[i] = read();
  memset(fir, 255, sizeof(fir));
  tot = 0;
  for (int i = 1; i < n; i++) {
    int x = read(), y = read(), z = read();
    add_edge(x, y, z);
    add_edge(y, x, z);
  }
  Data ans = solve(1);
  printf("%d %.10lf\n", ans.id, ans.val);
  return 0;
}
